Maximum spread of graphs without paths of specified length
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2121221 (Why is no real title available?)
- A Spectral Erdős-Sós Theorem
- An upper bound on the sum of squares of degrees in a graph
- Connected graphs without long paths
- Inequalities for normal and Hermitian matrices
- Lower bounds for the spread of a matrix
- Maximum spread of \(K_{2,t}\)-minor-free graphs
- Maximum spread of \(K_{s,t}\)-minor-free graphs
- Maximum spread of graphs and bipartite graphs
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- On maximal paths and circuits of graphs
- On the maximum second eigenvalue of outerplanar graphs
- On the maximum spread of planar and outerplanar graphs
- On the spectral spread of bicyclic graphs with given girth
- On the spread of a hermitian matrix and a conjecture of thompson
- On the spread of matrices and polynomials
- On the spread of outerplanar graphs
- On the spread of the spectrum of a graph
- Path Ramsey numbers in multicolorings
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
- The Colin de Verdière parameter, excluded minors, and the spectral radius
- The Laplacian spread of a tree
- The Laplacian spread of unicyclic graphs
- The eigenvalue spreads of a hermitian matrix and its principal submatrices
- The maximum spectral radius of graphs without friendship subgraphs
- The spectral even cycle problem
- The spectral radius of graphs without paths and cycles of specified length
- The spread of a matrix
- The spread of the spectrum of a graph
- The spread of the unicyclic graphs
- The spread of unicyclic graphs with given size of maximum matchings
- Three conjectures in extremal spectral graph theory
This page was built for publication: Maximum spread of graphs without paths of specified length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907719)
