A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Entropy of Symmetric Graphs
[article]

2013
*
arXiv
*
pre-print

A graph G is called symmetric with respect to a functional F_G(P) defined on the set of all the probability distributions on its vertex set if the distribution P^* maximizing F_G(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

arXiv:1311.6561v1
fatcat:7y6wotqinfh63gdvpplzu34yga