Uniquely Distinguishing Colorable Graphs
M. Korivand, N. Soltankhah, and K. Khashyarmanesh

TL;DR
This paper explores the unique colorability of graphs with respect to distinguishing colorings, introduces new graph families, and characterizes how the distinguishing chromatic number behaves under graph unions, with applications to disconnected graphs.
Contribution
It introduces two new families of uniquely distinguishing colorable graphs and characterizes the distinguishing chromatic number for various graph unions and classes.
Findings
Every disconnected uniquely distinguishing colorable graph is a union of two isomorphic type 2 graphs.
Any n-colorable uniquely distinguishing tree with n ≥ 3 is a star graph.
Characterizations of graphs based on their distinguishing chromatic number after union operations.
Abstract
A graph is called uniquely distinguishing colorable if there is only one partition of vertices of the graph that forms distinguishing coloring with the smallest possible colors. In this paper, we study the unique colorability of the distinguishing coloring of a graph and its applications in computing the distinguishing chromatic number of disconnected graphs. We introduce two families of uniquely distinguishing colorable graphs, namely type 1 and type 2, and show that every disconnected uniquely distinguishing colorable graph is the union of two isomorphic graphs of type 2. We obtain some results on bipartite uniquely distinguishing colorable graphs and show that any uniquely distinguishing -colorable tree with is a star graph. For a connected graph , we prove that if and only if is uniquely distinguishing colorable of type 1. Also, a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems
