On the locating chromatic number of certain barbell graphs
From MaRDI portal
Publication:1728997
DOI10.1155/2018/5327504zbMath1486.05069OpenAlexW2886483931MaRDI QIDQ1728997
I. Ketut Sadha Gunce Yana, Lyra Yulianti, Asmiati
Publication date: 27 February 2019
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/5327504
Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
The locating chromatic number for m-shadow of a connected graph ⋮ THE NUMBER OF CC-DOMINATING SETS OF SOME GRAPHS ⋮ On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph
Cites Work
- On the locating chromatic number of Kneser graphs
- Graphs of order \(n\) with locating-chromatic number \(n-1\)
- Conditional resolvability in graphs: a survey
- On locating-chromatic number of complete \(n\)-ary tree
- Structure-activity maps for visualizing the graph variables arising in drug design
- ON SOME PETERSEN GRAPHS HAVING LOCATING CHROMATIC NUMBER FOUR OR FIVE
- Characterizing all trees with locating-chromatic number 3
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the locating chromatic number of certain barbell graphs