Applications of the Kelmans transformation: extremality of the threshold graphs

zbMATH Open1337.05060MaRDI QIDQ640440FDOQ640440

Authors: Péter Csikvári 

Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p182.html

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Extremal threshold graphs for matchings and independent sets
• Extremal graphs for the Tutte polynomial
• Note on chromatic polynomials of the threshold graphs
• Extremal graphs for homomorphisms
• Two graph transformations and their applications to matching theory of graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35)

Cited In (9)

• Graph vulnerability parameters, compression, and threshold graphs
• The maximum spectral radius of graphs without spanning linear forests
• Graph vulnerability parameters, compression, and quasi-threshold graphs
• Extremal threshold graphs for matchings and independent sets
• Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• Extremal graphs for the Tutte polynomial
• A reverse Sidorenko inequality
• Further results on the largest matching root of unicyclic graphs

This page was built for publication: Applications of the Kelmans transformation: extremality of the threshold graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640440)