The total detection numbers of graphs

zbMATH Open1252.05060MaRDI QIDQ2906262FDOQ2906262

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)

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

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)

Cited In (6)

• On the total detection numbers of complete bipartite graphs
• A note on the total detection numbers of cycles
• Detection number of bipartite graphs and cubic graphs
• Parameterized and approximation complexity of the detection pair problem in graphs
• On detectable colorings of graphs
• Detecting and Counting Small Pattern 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)