A note on the potential function of an arbitrary graph H

DOI10.2298/FIL2011759YMaRDI QIDQ5081262zbMATH OpenFDO

Authors Jian-Hua Yin, Guangming Li

Publication date 14 June 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/FIL2011759Y

zbMATH Keywords

graphic sequencepotential functionpotentially \(H\)-graphic sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Cites work

• A General Lower Bound for Potentially H-Graphic Sequences
• A remark on the existence of finite graphs
• An extremal problem on the potentially \(P_k\)-graphic sequences
• Graphic sequences with a realization containing a friendship graph
• Graphic sequences with a realization containing a generalized friendship graph
• Graphic sequences with a realization containing a union of cliques
• 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 2114678 (Why is no real title available?)
• scientific article; zbMATH DE number 867707 (Why is no real title available?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the potential function of an arbitrary graph \(H\)
• On the sum necessary to ensure that a degree sequence is potentially H-graphic
• 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
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size

Cited in

(1)

• Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture

This page was built for publication: A note on the potential function of an arbitrary graph H

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