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 条
  • [41] Edge-disjoint node-independent spanning trees in dense Gaussian networks
    AlBdaiwi, Bader
    Hussain, Zaid
    Cerny, Anton
    Aldred, Robert
    JOURNAL OF SUPERCOMPUTING, 2016, 72 (12): : 4718 - 4736
  • [42] A NOTE ON FINDING MINIMUM-COST EDGE-DISJOINT SPANNING-TREES
    ROSKIND, J
    TARJAN, RE
    MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (04) : 701 - 708
  • [43] Edge-disjoint node-independent spanning trees in dense Gaussian networks
    Bader AlBdaiwi
    Zaid Hussain
    Anton Cerny
    Robert Aldred
    The Journal of Supercomputing, 2016, 72 : 4718 - 4736
  • [44] A Discharging Method to Find Subgraphs Having Two Edge-disjoint Spanning Trees
    Wang, Keke
    Zhan, Mingquan
    Lai, Hong-Jian
    ARS COMBINATORIA, 2019, 144 : 187 - 193
  • [45] Edge-disjoint placement of three trees
    Maheo, M
    Sacle, JF
    Wozniak, M
    EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (06) : 543 - 563
  • [46] EDGE-DISJOINT HAMILTON CYCLES IN GRAPHS
    LI, H
    ZHU, YJ
    ANNALS OF THE NEW YORK ACADEMY OF SCIENCES, 1989, 576 : 311 - 322
  • [47] Edge-Disjoint Fibonacci Trees in Hypercube
    Raman, Indhumathi
    Kuppusamy, Lakshmanan
    JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS, 2014, 2014
  • [48] Edge-Disjoint Branchings in Temporal Graphs
    Campos, Victor
    Lopes, Raul
    Marino, Andrea
    Silva, Ana
    COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 112 - 125
  • [49] Edge-disjoint Hamilton cycles in graphs
    Christofides, Demetres
    Kuehn, Daniela
    Osthus, Deryk
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (05) : 1035 - 1060
  • [50] Edge-disjoint paths in planar graphs
    Chekuri, C
    Khanna, S
    Shepherd, FB
    45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 71 - 80
12345