Counting degree sequences of spanning trees in bipartite graphs: A graph-theoretic proof

被引：0
|
作者：
Fischer, Anja [1 ]
Fischer, Frank [2 ]
机构：
[1] TU Dortmund Univ, Fac Business & Econ, Vogelpothsweg 87, D-44227 Dortmund, Germany
[2] Johannes Gutenberg Univ Mainz, Inst Comp Sci, Mainz, Germany
来源：
JOURNAL OF GRAPH THEORY | 2019年 / 92卷 / 03期
关键词：
bipartite graphs; degree sequences; spanning trees;
D O I：
10.1002/jgt.22449
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Given a bipartite graph G = (S (boolean OR) over dot T, E) with bipartition S, T each spanning tree in G has a degree sequence on S and one on T. Lohne and Rudloff showed that the number of possible degree sequences on S equals the number of possible degree sequences on T. Their proof uses a non-trivial characterization of degree sequences by G-draconian sequences based on polyhedral results of Postnikov. In this paper, we give a purely graph-theoretic proof of their result.
引用
收藏
页码：230 / 236
页数：7
相关论文
共 50 条
  • [1] Degree sequences and graphs with disjoint spanning trees
    Lai, Hong-Jian
    Liang, Yanting
    Li, Ping
    Xu, Jinquan
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (14) : 1447 - 1452
  • [2] Degree Conditions for Completely Independent Spanning Trees of Bipartite Graphs
    Yuan, Jun
    Zhang, Ru
    Liu, Aixia
    GRAPHS AND COMBINATORICS, 2022, 38 (06)
  • [3] Degree Conditions for Completely Independent Spanning Trees of Bipartite Graphs
    Jun Yuan
    Ru Zhang
    Aixia Liu
    Graphs and Combinatorics, 2022, 38
  • [4] Counting spanning trees in a complete bipartite graph which contain a given spanning forest
    Dong, Fengming
    Ge, Jun
    JOURNAL OF GRAPH THEORY, 2022, 101 (01) : 79 - 85
  • [5] Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
    Gu, Xiaofeng
    Lai, Hong-Jian
    Liang, Yanting
    APPLIED MATHEMATICS LETTERS, 2012, 25 (10) : 1426 - 1429
  • [6] Bipartite graphs with even spanning trees
    Hoffman, Dean G.
    Walsh, Matt
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2006, 35 : 3 - 6
  • [7] A GRAPH-THEORETIC ENCODING OF LUCAS SEQUENCES
    Alexander, James
    Hearding, Paul
    FIBONACCI QUARTERLY, 2015, 53 (03): : 237 - 240
  • [8] Spanning bipartite graphs with high degree sum in graphs
    Chen, Guantao
    Chiba, Shuya
    Gould, Ronald J.
    Gu, Xiaofeng
    Saito, Akira
    Tsugaki, Masao
    Yamashita, Tomoki
    DISCRETE MATHEMATICS, 2020, 343 (02)
  • [9] Maximizing Closeness in Bipartite Networks: A Graph-Theoretic Analysis
    Hayat, Fazal
    Otera, Daniele Ettore
    MATHEMATICS, 2024, 12 (13)
  • [10] Counting the number of spanning trees of graphs
    Ghorbani, M.
    Bani-Asadi, E.
    IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, 2013, 4 (01): : 111 - 121
12345