The dominating partition dimension and locating-chromatic number of graphs
From MaRDI portal
Publication:6090326
DOI10.5614/ejgta.2023.11.2.10zbMath1527.05139OpenAlexW4388036328MaRDI QIDQ6090326
Unnamed Author, Edy Tri Baskoro, Hilda Assiyatun
Publication date: 16 December 2023
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2023.11.2.10
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The partition dimension of a graph
- Resolving dominating partitions in graphs
- Domination and location in acyclic graphs
- Resolving domination in graphs
- Characterizing all graphs containing cycles with locating-chromatic number 3
- Characterizing all trees with locating-chromatic number 3
This page was built for publication: The dominating partition dimension and locating-chromatic number of graphs