Graphic sequences with a realization containing a generalized friendship graph

DOI10.1016/J.DISC.2007.11.075MaRDI QIDQ998359zbMATH OpenOpenAlexFDO

Authors Gang Chen, John Schmitt, Jian-Hua Yin

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 sequencegeneralized friendship graphpotentially \(F_{t, r, k}\)-graphic sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Recommendations

• Graphic sequences with a realization containing intersecting cliques
• Graphic sequences with a realization containing a friendship graph
• Potentially \(F_{2m+i}\)-graphic sequences
• Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences
• An extremal problem on the potentially \(K_{r,s,t}\)-graphic sequences

Cites work

• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 1286471 (Why is no real title available?)
• scientific article; zbMATH DE number 867707 (Why is no real title available?)
• A General Lower Bound for Potentially H-Graphic Sequences
• A remark on the existence of finite graphs
• An extremal problem on potentially \(K_m-C_4\)-graphic sequences
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• An extremal problem on the potentially \(P_k\)-graphic sequences
• Extremal graphs for intersecting cliques
• Graphic sequences with a realization containing a friendship graph
• Graphic sequences with a realization containing a union of cliques
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On potentially \(K_{r_1,r_2,\dots,r_m}\)-graphic sequences
• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• 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

Cited in

(11)

• Graphic sequences with a realization containing intersecting cliques
• Graphic sequences with an \(A\)-connected realization
• Graphic sequences with a realization containing a friendship graph
• Potentially K m — G-graphical sequences: A survey
• Potentially \(F_{2m+i}\)-graphic sequences
• Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture
• Spectral radii of friendship graphs and their connected induced subgraphs
• tK\(_p\)-saturated graphs of minimum size
• On the potential function of an arbitrary graph \(H\)
• Friendship decompositions of graphs
• A note on the potential function of an arbitrary graph H

This page was built for publication: Graphic sequences with a realization containing a generalized friendship graph

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