On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph

DOI10.22342/JIMS.26.2.822.175-184zbMATH Open1451.05086OpenAlexW3087852249MaRDI QIDQ5142014

H. Assiyatun, Brilly Maxel Salindeho, Edy Tri Baskoro

Publication date: 29 December 2020

Published in: Journal of the Indonesian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22342/jims.26.2.822.175-184

zbMATH Keywords

subdivisionlocating coloringfriendship graphlocating-chromatic number

Mathematics Subject Classification ID

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

Cites Work

• The locating chromatic number of the join of graphs
• On the locating chromatic number of certain barbell graphs
• On the locating chromatic number of the Cartesian product of graphs.
• The locating-chromatic number for Halin graphs
• A Bound for the Locating Chromatic Numbers of Trees
• Characterizing all trees with locating-chromatic number 3

This page was built for publication: On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph

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