A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC

被引：2

作者：

Cairns, Grant ^{[1
]}

Mendan, Stacey ^{[1
]}

Nikolayevsky, Yuri ^{[1
]}

机构：

[1] La Trobe Univ, Dept Math & Stat, Melbourne, Vic 3086, Australia

来源：

BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY | 2016年 / 94卷 / 02期

关键词：

bipartite graph; degree sequence; ZVEROVICH-ZVEROVICH;

D O I：

10.1017/S0004972716000198

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We present a sufficient condition for a pair of finite integer sequences to be degree sequences of a bipartite graph, based only on the lengths of the sequences and their largest and smallest elements.

引用

页码：195 / 200

页数：6

共 50 条

[21] A necessary and sufficient condition for sequences to be minimal completely monotonic
Xi-Feng Wang
Mourad E. H. Ismail
Necdet Batir
S. Guo
Advances in Difference Equations, 2020
[22] A Necessary and Sufficient Graphic Condition for the Original Disturbance Decoupling of Boolean Networks
Li, Yifeng
Zhu, Jiandong
Li, Bowen
Liu, Yang
Lu, Jianquan
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2021, 66 (08) : 3765 - 3772
[23] Characterisation of potentially generalised bipartite self-complementary bi-graphic sequences
Bhave, NS
DISCRETE MATHEMATICS, 1998, 186 (1-3) : 39 - 54
[24] Large Deviation Principle for Exchangeable Sequences: Necessary and Sufficient Condition
L. Wu
Journal of Theoretical Probability, 2004, 17 : 967 - 978
[25] Large deviation principle for exchangeable sequences: Necessary and sufficient condition
Wu, L
JOURNAL OF THEORETICAL PROBABILITY, 2004, 17 (04) : 967 - 978
[26] A Note on Dominating Pair Degree Condition for Hamiltonian Cycles in Balanced Bipartite Digraphs
Ruixia Wang
Graphs and Combinatorics, 2022, 38
[27] A Note on Dominating Pair Degree Condition for Hamiltonian Cycles in Balanced Bipartite Digraphs
Wang, Ruixia
GRAPHS AND COMBINATORICS, 2022, 38 (01)
[28] A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected
Yin, Jian-hua
Guo, Ji-yun
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2022, 38 (01): : 223 - 228
[29] A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected
Jian-hua Yin
Ji-yun Guo
Acta Mathematicae Applicatae Sinica, English Series, 2022, 38 : 223 - 228
[30] A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected
Jian-hua YIN
Ji-yun GUO
ActaMathematicaeApplicataeSinica, 2022, 38 (01) : 223 - 228

← 1 2 3 4 5 →