The total detection numbers of graphs

MaRDI QIDQ2906262zbMATH OpenFDO

Authors Henry Escuadro, Futaba Fujie-Okamoto

Publication date 5 September 2012

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

detectable labelingdetection numbertotal detection numbervertex-distinguishing coloring

Mathematics Subject Classification ID

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

Recommendations

• A note on the total detection numbers of cycles
• On the total detection numbers of complete bipartite graphs
• scientific article; zbMATH DE number 5054146
• On detectable colorings of graphs
• Extremal problems on detectable colorings of trees

Cited in

(6)

• A note on the total detection numbers of cycles
• Detecting and Counting Small Pattern Graphs
• On detectable colorings of graphs
• On the total detection numbers of complete bipartite graphs
• Detection number of bipartite graphs and cubic graphs
• Parameterized and approximation complexity of the detection pair problem in graphs

This page was built for publication: The total detection numbers of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906262)