Entropy of symmetric graphs

Citations of this article
Mendeley users who have this article in their library.


Let FG(P) be a functional defined on the set of all the probability distributions on the vertex set of a graph G. We say that G is symmetric with respect to FG(P) if the distribution P∗ maximizing FG(P) is uniform on V(G). Using the combinatorial definition of the entropy of a graph in terms of its vertex packing polytope and the relationship between the graph entropy and fractional chromatic number, we prove that vertex-transitive graphs are symmetric with respect to graph entropy. As the main result of this paper, we prove that a perfect graph is symmetric with respect to graph entropy if and only if its vertices can be covered by disjoint copies of its maximum-size clique. Particularly, this means that a bipartite graph is symmetric with respect to graph entropy if and only if it has a perfect matching.




Changiz Rezaei, S. S., & Godsil, C. (2016). Entropy of symmetric graphs. Discrete Mathematics, 339(2), 475–483. https://doi.org/10.1016/j.disc.2015.09.020

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free