Spectral radius and edge-disjoint spanning trees

被引：0
|
作者：
Fan, Dandan [1 ,2 ]
Gu, Xiaofeng [3 ]
Lin, Huiqiu [1 ]
机构：
[1] School of Mathematics, East China University of Science and Technology, Shanghai,200237, China
[2] College of Mathematics and Physics, Xinjiang Agricultural University, Xinjiang, Urumqi,830052, China
[3] Department of Computing and Mathematics, University of West Georgia, Carrollton,GA,30118, United States
来源：
arXiv | 2022年
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Matrix algebra - Trees (mathematics)
引用
收藏
相关论文
共 50 条
  • [41] Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs
    Lin, CT
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2003, 63 (12) : 1277 - 1287
  • [42] Edge-Disjoint Steiner Trees and Connectors in Graphs
    Hengzhe Li
    Huayue Liu
    Jianbing Liu
    Yaping Mao
    [J]. Graphs and Combinatorics, 2023, 39
  • [43] Building k edge-disjoint spanning trees of minimum total length for isometric data embedding
    Yang, L
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (10) : 1680 - 1683
  • [44] Edge-Disjoint Steiner Trees and Connectors in Graphs
    Li, Hengzhe
    Liu, Huayue
    Liu, Jianbing
    Mao, Yaping
    [J]. GRAPHS AND COMBINATORICS, 2023, 39 (02)
  • [45] Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees
    [J]. Narayanan, H., 1600, (23):
  • [46] Three Edge-Disjoint Plane Spanning Paths in a Point Set
    Kindermann, P.
    Kratochvil, J.
    Liotta, G.
    Valtr, P.
    [J]. GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2023, PT I, 2023, 14465 : 323 - 338
  • [47] A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs
    Gu, Xiaofeng
    Lai, Hong-Jian
    [J]. DISCRETE MATHEMATICS, 2018, 341 (02) : 400 - 404
  • [48] RANDOMIZED PARALLEL ALGORITHMS FOR MATROID UNION AND INTERSECTION, WITH APPLICATIONS TO ARBORESENCES AND EDGE-DISJOINT SPANNING-TREES
    NARAYANAN, H
    SARAN, H
    VAZIRANI, VV
    [J]. SIAM JOURNAL ON COMPUTING, 1994, 23 (02) : 387 - 397
  • [49] The maximum edge-disjoint paths problem in bidirected trees
    Erlebach, T
    Jansen, K
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2001, 14 (03) : 326 - 355
  • [50] Finding Edge-Disjoint Paths in Partial k -Trees
    X. Zhou
    S. Tamura
    T. Nishizeki
    [J]. Algorithmica, 2000, 26 : 3 - 30
12345