Extremal graphs for a spectral inequality on edge-disjoint spanning trees

被引：0
|
作者：
University of Delaware, Newark [1 ]
DE
19716, United States
不详 [2 ]
MD
20878, United States
不详 [3 ]
MA
02139, United States
机构：
来源：
arXiv | 1600年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Eigenvalues and eigenfunctions
引用
收藏
相关论文
共 50 条
  • [21] EDGE-DISJOINT SPANNING-TREES - A CONNECTEDNESS THEOREM
    FARBER, M
    RICHTER, B
    SHANK, H
    JOURNAL OF GRAPH THEORY, 1985, 9 (03) : 319 - 324
  • [22] Constructing edge-disjoint spanning trees in product networks
    Ku, SC
    Wang, BF
    Hung, TK
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (03) : 213 - 221
  • [23] Good orientations of unions of edge-disjoint spanning trees
    Bang-Jensen, Jorgen
    Bessy, Stephane
    Huang, Jing
    Kriesell, Matthias
    JOURNAL OF GRAPH THEORY, 2021, 96 (04) : 594 - 618
  • [24] Edge-Disjoint Steiner Trees and Connectors in Graphs
    Li, Hengzhe
    Liu, Huayue
    Liu, Jianbing
    Mao, Yaping
    GRAPHS AND COMBINATORICS, 2023, 39 (02)
  • [25] ANTI-RAMSEY NUMBER OF EDGE-DISJOINT RAINBOW SPANNING TREES IN ALL GRAPHS
    Lu, Linyuan
    Meier, Andrew
    Wang, Zhiyu
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 1162 - 1172
  • [26] Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs
    Lin, CT
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2003, 63 (12) : 1277 - 1287
  • [27] EDGE-DISJOINT SPANNING TREES AND DEPTH-FIRST SEARCH
    TARJAN, RE
    ACTA INFORMATICA, 1976, 6 (02) : 171 - 185
  • [28] On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
    Frieze, Alan
    Johansson, Tony
    COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (02): : 228 - 244
  • [29] Constructing edge-disjoint spanning trees in locally twisted cubes
    Hsieh, Sun-Yuan
    Tu, Chang-Jen
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 926 - 932
  • [30] Edge-disjoint spanning trees for the generalized butterfly networks and their applications
    Touzene, A
    Day, K
    Monien, B
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (11) : 1384 - 1396
12345