129,894 research outputs found
Uniquely Distinguishing Colorable Graphs
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 characterization of
all graphs of order with the property that , where , is given in this paper. Moreover, we
determine all graphs of order with the property that , where . Finally, we investigate the
family of connected graphs with
Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy
The Laplacian energy of a graph is the sum of the distances of the
eigenvalues of the Laplacian matrix of the graph to the graph's average degree.
The maximum Laplacian energy over all graphs on nodes and edges is
conjectured to be attained for threshold graphs. We prove the conjecture to
hold for graphs with the property that for each there is a threshold graph
on the same number of nodes and edges whose sum of the largest Laplacian
eigenvalues exceeds that of the largest Laplacian eigenvalues of the graph.
We call such graphs spectrally threshold dominated. These graphs include split
graphs and cographs and spectral threshold dominance is preserved by disjoint
unions and taking complements. We conjecture that all graphs are spectrally
threshold dominated. This conjecture turns out to be equivalent to Brouwer's
conjecture concerning a bound on the sum of the largest Laplacian
eigenvalues
- …