Graphic sequences with a realization containing a generalized friendship graph

DOI10.1016/j.disc.2007.11.075zbMath1167.05310MaRDI QIDQ998359

Jian Hua Yin, John R. Schmitt, Gang Chen

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.075

zbMATH Keywords

degree sequence; generalized friendship graph; potentially \(F_{t, r, k}\)-graphic sequence

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C07: Vertex degrees

Related Items

tK\(_p\)-saturated graphs of minimum size, Potentially K m — G-graphical sequences: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphic sequences with a realization containing a union of cliques
• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• Extremal graphs for intersecting cliques
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• An extremal problem on the potentially \(P_k\)-graphic sequences
• The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
• The threshold for the Erdős, Jacobson and Lehel conjecture to be true
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A General Lower Bound for Potentially H-Graphic Sequences