A Rao-type characterization for a sequence to have a realization containing a split graph

DOI10.1016/J.DISC.2011.07.024zbMath1238.05063OpenAlexW1970152836MaRDI QIDQ409361

Jian Hua Yin

Publication date: 13 April 2012

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

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

zbMATH Keywords

split graphgraphic sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (6)

A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic ⋮ Graphic sequences and split graphs ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ Recognition of split-graphic sequences ⋮ Stability of the Potential Function ⋮ Bigraphic pairs with a realization containing a split bipartite-graph

Cites Work

• The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)
• Some Properties of Graphs with Multiple Edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Rao-type characterization for a sequence to have a realization containing a split graph