On the total detection numbers of complete bipartite graphs

DOI10.1016/J.DISC.2013.09.001zbMath1281.05120OpenAlexW2017798593MaRDI QIDQ394295

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

Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.09.001

zbMATH Keywords

vertex-distinguishing coloringdetectable labelingdetection numbertotal detection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

A note on the total detection numbers of cycles

Cites Work

• The irregular coloring number of a tree
• A note on the total detection numbers of cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the total detection numbers of complete bipartite graphs