A note on the total detection numbers of cycles

DOI10.7151/DMGT.1792zbMath1311.05060OpenAlexW2059670083MaRDI QIDQ2344011

Chad E. Musick, Henry E. Escuadro, Futaba Fujie

Publication date: 11 May 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1792

zbMATH Keywords

Hamiltonian graphvertex-distinguishing coloringdetectable labelingdetection numbertotal detection number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On the total detection numbers of complete bipartite graphs

Cites Work

• On the total detection numbers of complete bipartite graphs
• The irregular coloring number of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the total detection numbers of cycles