On the characterization of potentially K₁,1,s-graphic sequences

MaRDI QIDQ3108601zbMATH OpenFDO

Authors Meng-Xiao Yin, Jian-Hua Yin, Cheng Zhong, Feng Yang

Publication date 5 January 2012

zbMATH Keywords

graphdegree sequencepotentially \(K_{1,1,s}\)-graphic sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Recommendations

• A note on the characterization of potentially \(K_{1,1,s}\)-graphic sequences.
• The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)
• A characterization for a graphic sequence to be potentially \(K_{1^3, 4}\)-graphic
• On potentially \(K_{2,2,1,1}\)-graph graphic sequences
• On potentially \(K_{r_1,r_2,\dots,r_m}\)-graphic sequences

Cited in

(10)

• A Rao-type characterization for a sequence to have a realization containing a split graph
• A condition that yields potentially \(K_{1^3, s}\)-graphic sequences
• A note on the characterization of potentially \(K_{1,1,s}\)-graphic sequences.
• The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)
• On potentially \(K_{r_1,r_2,\dots,r_m}\)-graphic sequences
• A characterization for a graphic sequence to be potentially \(K_{2,s}\)-graphic
• A characterization for a graphic sequence to be potentially \(K_{1^3, 4}\)-graphic
• On potentially \(K_{2,2,1,1}\)-graph graphic sequences
• A condition that yields potentially \(K_{1^4, s}\)-graphic sequences
• Characterisation of potentially generalised bipartite self-complementary bi-graphic sequences

This page was built for publication: On the characterization of potentially \(K_{1,1,s}\)-graphic sequences

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