On the comparison of the distinguishing coloring and the locating coloring of graphs
From MaRDI portal
Publication:6095325
DOI10.1007/S00009-023-02410-5zbMATH Open1520.05038arXiv2112.03594OpenAlexW4381328273MaRDI QIDQ6095325FDOQ6095325
M. Korivand, A. Erfanian, E. T. Baskoro
Publication date: 8 September 2023
Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)
Abstract: Let G be a simple connected graph. Then chi L(G) and chi D(G) will denote the locating chromatic number and the distinguishing chromatic number of G, respectively. In this paper, we investigate a comparison between chi L(G) and chi D(G). In fact, we prove that chi D(G) leq chi L(G). Moreover, we determine some types of graphs whose locating and distinguishing chromatic numbers are equal. Specially, we characteristic all graph G with the property that chi D(G)= chi L(G) = 3.
Full work available at URL: https://arxiv.org/abs/2112.03594
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs of order \(n\) with locating-chromatic number \(n-1\)
- The locating chromatic number of the join of graphs
- On the locating chromatic number of the Cartesian product of graphs.
- Destroying automorphisms by fixing nodes
- Graphs with large distinguishing chromatic number
- Distinguishing Chromatic Number of Cartesian Products of Graphs
- The distinguishing chromatic number
- Distinguishing colorings of Cartesian products of complete graphs
- Characterizing all trees with locating-chromatic number 3
- Improved algorithm for the locating-chromatic number of trees
- Characterizing all graphs containing cycles with locating-chromatic number 3
Cited In (2)
This page was built for publication: On the comparison of the distinguishing coloring and the locating coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6095325)
