Spectral radius conditions for fractional \([a,b]\)-covered graphs
From MaRDI portal
Publication:2696295
DOI10.1016/j.laa.2023.02.014OpenAlexW4321486967MaRDI QIDQ2696295
Jiaxin Zheng, Yonglei Chen, Junjie Wang
Publication date: 11 April 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.03367
spectral radiusfractional \([a, b\)-factor]fractional \([a, b\)-covered graph]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral radius and fractional matchings in graphs
- Sufficient condition for the existence of an even \([a,b\)-factor in graph]
- Signless Laplacian spectral radius and fractional matchings in graphs
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- A bound on the spectral radius of graphs
- A degree condition for fractional \([a,b\)-covered graphs]
- The Randić index and signless Laplacian spectral radius of graphs
- Edge-connectivity and edges of even factors of graphs
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- The spectral radius of trees on \(k\) pendant vertices
- Characterization of forbidden subgraphs for the existence of even factors in a graph
- Neighborhood union conditions for fractional \([a, b\)-covered graphs]
- Sharp lower bounds on the fractional matching number
- A degree condition for a graph to have \((a,b)\)-parity factors
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Towards a spectral theory of graphs based on the signless Laplacian, I
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Fractional \((g,f)\)-factors of graphs
This page was built for publication: Spectral radius conditions for fractional \([a,b]\)-covered graphs
