On the spectral radius of graphs without a gem
From MaRDI portal
Publication:6589142
Recommendations
Cites work
- A contribution to the Zarankiewicz problem
- A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
- A spectral condition for odd cycles in graphs
- A spectral condition for the existence of the square of a path
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- A survey on spectral conditions for some extremal graph problems
- A unique characterization of spectral extrema for friendship graphs
- Bounds on graph eigenvalues. II
- Graph theory
- On the spectral radius of (0,1)-matrices
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Some new results and problems in spectral extremal graph theory
- Some new results in extremal graph theory
- Spectral bounds for the clique and independence numbers of graphs
- Spectral extrema for graphs: the Zarankiewicz problem
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Spectral extrema of graphs: forbidden hexagon
- Spectral extremal graphs for the bowtie
- Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \)
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- The maximum spectral radius of graphs without friendship subgraphs
- The spectral radius of \(H_{2k}\)-free graphs
- The spectral radius of graphs without long cycles
- The spectral radius of graphs without paths and cycles of specified length
- The spectral radius of trees on \(k\) pendant vertices
- Walks and the spectral radius of graphs
This page was built for publication: On the spectral radius of graphs without a gem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589142)
