Perfect matching and distance spectral radius in graphs and bipartite graphs

DOI10.1016/j.dam.2021.08.008zbMath1473.05194arXiv2101.04324OpenAlexW3196203100MaRDI QIDQ2231774

Yuke Zhang, Huiqiu Lin

Publication date: 30 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.04324

zbMATH Keywords

perfect matchingdistance spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Spectral radius and fractional perfect matchings in graphs, Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical, Matching extension and distance spectral radius, Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index, \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs, The \(A_\alpha\)-spectral radius for path-factors in graphs, Distance spectrum, 1-factor and vertex-disjoint cycles, On the \(A_\alpha\)-spectral radius of graphs without large matchings

Cites Work

• Proximity, remoteness and distance eigenvalues of a graph
• Extremal unicyclic graphs with minimal distance spectral radius
• Distance spectral radius of trees with given matching number
• Spectral radius of graphs with given matching number
• Bounds on the second largest eigenvalue of a tree with perfect matchings
• Problems in algebraic combinatorics
• Bounds on the largest eigenvalues of trees with a given size of matching
• Extremal cacti of given matching number with respect to the distance spectral radius
• On the sum of \(k\) largest distance eigenvalues of graphs
• Eigenvalues and perfect matchings
• On the second largest distance eigenvalue of a block graph
• Extremal problems on distance spectra of graphs
• Distance eigenvalues of a cograph and their multiplicities
• Spectral radius and matchings in graphs
• Distance spectra of graphs: a survey
• On spectral radius of the distance matrix
• On the Addressing Problem for Loop Switching
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item