We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
The dominating partition dimension and locating-chromatic number of graphs.
- Authors
Ridwan, Muhammad; Assiyatun, Hilda; Baskoro, Edy Tri
- Abstract
For every graph G, the dominating partition dimension of G is either the same as its partition dimension or one higher than its partition dimension. In this paper, we consider some general connections among these three graph parameters: partition dimension, locating-chromatic number, and dominating partition dimension. We will show that βp(G)≤ηp(G)≤χL(G) for any graph G with at least 3 vertices. Therefore, we will derive properties for which graphs G have ηp(G)=βp(G) or ηp(G)=βp(G)+1.
- Publication
Electronic Journal of Graph Theory & Applications, 2023, Vol 11, Issue 2, p455
- ISSN
2338-2287
- Publication type
Article
- DOI
10.5614/ejgta.2023.11.2.10