ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS

DOI10.1017/s0004972722001551zbMath1525.05113OpenAlexW4316039861MaRDI QIDQ6082047

Shuchao Li, Shujing Miao, Minjie Zhang

Publication date: 3 November 2023

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972722001551

zbMATH Keywords

spectral radiussizedistance spectral radiusfractional perfect matching

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75)

Related Items (1)

Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral radius and fractional matchings in graphs
• Extremal unicyclic graphs with minimal distance spectral radius
• Distance spectral radius of trees with given matching number
• Spectra of graphs
• Eigenvalues and perfect matchings
• On the spectrum of an equitable quotient matrix and its application
• Spectral radius and matchings in graphs
• Matrix Analysis
• On spectral radius of the distance matrix

This page was built for publication: ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS