Abstract
A graph transformation called the compression of a graph G is known to decrease the number of spanning trees, the all-terminal reliability, and the magnitude of the coefficients of the chromatic polynomial of a graph G. All of these graph parameters can be derived from the Tutte polynomial of G, and in this paper we determine more generally compression's effect on the Tutte polynomial, recovering the previous results and obtaining similar results for a wide variety of other graph parameters derived from the Tutte polynomial. Since any simple connected graph can be transformed into a connected threshold graph via a series of compressions, this gives that threshold graphs are extremal simple graphs for all of the parameters considered.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
