Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number

DOI10.1016/j.laa.2020.10.023zbMath1459.05174MaRDI QIDQ2228493

Hong-Jian Lai, Zheng-Jiang Xia, Zhen-Mu Hong, Rui-fang Liu

Publication date: 17 February 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2020.10.023

zbMATH Keywords

eigenvalue; girth; strength; clique number; fractional arboricity

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C40: Connectivity

Related Items

\(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fractional spanning tree packing, forest covering and eigenvalues
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Spectra of graphs
• Spectral conditions for edge connectivity and packing spanning trees in multigraphs
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Interlacing eigenvalues and graphs
• Connectivity and eigenvalues of graphs with given girth or clique number
• Note on edge-disjoint spanning trees and eigenvalues
• Vertex-connectivity and eigenvalues of graphs
• Spanning tree packing number and eigenvalues of graphs with given girth
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees and eigenvalues
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
• Decomposition of Finite Graphs Into Forests