Distance spectral radius and fractional matching in t -connected graphs

DOI10.1080/03081087.2024.2306329MaRDI QIDQ6655455

Huiqiu Lin, Yanling Hu, Zhi-Guo Zhang, Yuke Zhang

Publication date: 23 December 2024

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectral radius and fractional matchings in graphs
• Extremal unicyclic graphs with minimal distance spectral radius
• Factors and factorizations of graphs. Proof techniques in factor theory
• Distance spectral radius of trees with given matching number
• Signless Laplacian spectral radius and fractional matchings in graphs
• Extremal cacti of given matching number with respect to the distance spectral radius
• On the sum of \(k\) largest distance eigenvalues of graphs
• The maximum spectral radius of \(t\)-connected graphs with bounded matching number
• Distance spectra of graphs: a survey
• The distance spectrum of a tree
• On spectral radius of the distance matrix
• Fractional matching number and eigenvalues of a graph
• On the Addressing Problem for Loop Switching
• The Factorization of Linear Graphs
• Fractional matching number and spectral radius of nonnegative matrices of graphs
• ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS

This page was built for publication: Distance spectral radius and fractional matching in t -connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655455)