Distance spectral radius and fractional matching in t -connected graphs
From MaRDI portal
Publication:6655455
Recommendations
- ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS
- Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of fractional matching number
- Fractional matchings in graphs from the spectral radius
- Fractional matching number and eigenvalues of a graph
Cites work
- A survey on distance spectra of graphs
- Distance spectra of graphs: a survey
- Distance spectral radius of trees with given matching number
- Extremal cacti of given matching number with respect to the distance spectral radius
- Extremal unicyclic graphs with minimal distance spectral radius
- Factors and factorizations of graphs. Proof techniques in factor theory
- Fractional matching number and eigenvalues of a graph
- Fractional matching number and spectral radius of nonnegative matrices of graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- On spectral radius of the distance matrix
- On the Addressing Problem for Loop Switching
- ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS
- On the sum of k largest distance eigenvalues of graphs
- Signless Laplacian spectral radius and fractional matchings in graphs
- Spectral radius and fractional matchings in graphs
- The distance spectrum of a tree
- The Factorization of Linear Graphs
- The maximum spectral radius of \(t\)-connected graphs with bounded matching number
Cited in
(2)
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)
