Applications of the Kelmans transformation: extremality of the threshold graphs (Q640440)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Applications of the Kelmans transformation: extremality of the threshold graphs |
scientific article; zbMATH DE number 5960044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applications of the Kelmans transformation: extremality of the threshold graphs |
scientific article; zbMATH DE number 5960044 |
Statements
Applications of the Kelmans transformation: extremality of the threshold graphs (English)
0 references
18 October 2011
0 references
Summary: 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.
0 references
0.7579526901245117
0 references
0.7472023963928223
0 references
0.7326658964157104
0 references
0.7096337080001831
0 references
0.7057225704193115
0 references
