Abstract
In this paper we study various extremal problems related to some combinatorially defined graph polynomials such as matching polynomial, chromatic polynomial, Laplacian polynomial. It will turn out that many problems attain its extremal value in the class of threshold graphs. To attack these kinds of problems we survey several applications of the so-called Kelmans transformation.
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.
