The locating-chromatic number of firecracker graphs

MaRDI QIDQ4648329zbMATH OpenFDO

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

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)

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.

Cited in

(10)

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

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)