The locating-chromatic number of firecracker graphs

zbMATH Open1252.05057MaRDI QIDQ4648329FDOQ4648329

Authors: Asmiati, E. T. Baskoro, H. Assiyatun, Djoko Suprijanto, Rinovia Simanjuntak, S. Uttunggadewa 

Publication date: 9 November 2012

Full work available at URL: http://www.pphmj.com/abstract/6555.htm

Recommendations

• scientific article; zbMATH DE number 6413923
• Characterizing all trees with locating-chromatic number 3
• On the locating-chromatic number of homogeneous lobsters
• The locating-chromatic number for Halin graphs
• On the locating chromatic number of the Cartesian product of graphs.

zbMATH Keywords

color codelocating-chromatic numberfirecracker graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (10)

• Improved algorithm for the locating-chromatic number of trees
• The locating chromatic number for m-shadow of a connected graph
• On the locating chromatic number of certain barbell graphs
• Upper bounds on the locating chromatic number of trees
• Locating chromatic number of middle graph of path, cycle, star, wheel, gear and helm graphs
• On the locating-chromatic number of homogeneous lobsters
• On the metric dimension of circulant and Harary graphs
• The locating-chromatic number of disconnected graphs
• Calculating an upper bound of the locating-chromatic number of trees
• On the locating-chromatic numbers of subdivisions of friendship graph

This page was built for publication: The locating-chromatic number of firecracker graphs

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