Applications of the Kelmans transformation: extremality of the threshold graphs
The electronic journal of combinatorics, Tome 18 (2011) no. 1
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.
@article{10_37236_669,
author = {P\'eter Csikv\'ari},
title = {Applications of the {Kelmans} transformation: extremality of the threshold graphs},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/669},
zbl = {1337.05060},
url = {http://geodesic.mathdoc.fr/articles/10.37236/669/}
}
Péter Csikvári. Applications of the Kelmans transformation: extremality of the threshold graphs. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/669
Cité par Sources :