Key points are not available for this paper at this time.
For a graph G, a k-coloring c: V (G) \1, 2, , k\ is called distinguishing, if the only automorphism f of G with the property c (v) =c (f (v) ) for every vertex v G (color-preserving automorphism), is the identity. In this paper, we show that the number of distinguishing k-colorings of G is a monic polynomial in k, calling it the distinguishing polynomial of G. Furthermore, we compute the distinguishing polynomials of cycles and complete multipartite graphs. We also show that the multiplicity of zero as a root of the distinguishing polynomial of G is at least the number of orbits of G.
Building similarity graph...
Analyzing shared references across papers
Loading...
Haghighi et al. (Thu,) studied this question.
www.synapsesocial.com/papers/68e720d3b6db64358769a571 — DOI: https://doi.org/10.48550/arxiv.2403.19264
Mohammad Hassan Shirdareh Haghighi
Amir Mohammad Ghazanfari
Seyed Ali Reza Talebpour Shirazi Fard
Building similarity graph...
Analyzing shared references across papers
Loading...
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: