Adjacency eigenvalues of graphs without short odd cycles
From MaRDI portal
Publication:2237217
DOI10.1016/j.disc.2021.112633zbMath1480.05086arXiv2109.04599OpenAlexW3204462599MaRDI QIDQ2237217
Yuantian Yu, Shuchao Li, Wanting Sun
Publication date: 27 October 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.04599
Related Items (19)
Signless Laplacian spectral radius of graphs without short cycles or long cycles ⋮ Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ Ordering the maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter ⋮ A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size ⋮ The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size ⋮ Spectral extremal graphs for the bowtie ⋮ Refinement on Spectral Turán’s Theorem ⋮ Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles ⋮ On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles ⋮ Spectral radius conditions for the existence of all subtrees of diameter at most four ⋮ The index of signed graphs with forbidden subgraphs ⋮ Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index ⋮ A spectral extremal problem on non-bipartite triangle-free graphs ⋮ Spectral radius of graphs with given size and odd girth ⋮ Spectral extremal problem on disjoint color-critical graphs ⋮ Unnamed Item ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ On the \(A_\alpha\)-spectral radius of graphs without large matchings ⋮ The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Conjectured bounds for the sum of squares of positive eigenvalues of a graph
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Upper bounds for the achromatic and coloring numbers of a graph
- Lower bounds on the independence number of certain graphs of odd girth at least seven
- Spectra of graphs
- On a conjecture concerning spanning tree invariants and loop systems
- Spectral extrema of graphs: forbidden hexagon
- A contribution to the Zarankiewicz problem
- Walks and the spectral radius of graphs
- The spectral radius of graphs without paths and cycles of specified length
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- On the spectral radius of (0,1)-matrices
- Spectral bounds for the clique and independence numbers of graphs
- A bound on the spectral radius of graphs
- The independence number of dense graphs with large odd girth
- Graphs without short odd cycles are nearly bipartite
- A bound on the spectral radius of graphs with \(e\) edges
- Bounds of eigenvalues of a graph
- Cycles of even length in graphs
- A sharp upper bound of the spectral radius of graphs
- On the number of edges of quadrilateral-free graphs
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Maximum bisections of graphs without short even cycles
- Adjacency eigenvalues of graphs without short odd cycles
- Spectral extrema for graphs: the Zarankiewicz problem
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- Bounds on graph eigenvalues. II
- On the Turán number for the hexagon
- Pancyclic graphs. I
- Large cycles in graphs
- Cliques and the spectral radius
- Bipartite graphs with at most six non-zero eigenvalues
- Independence, odd girth, and average degree
- Vertex colorings of graphs without short odd cycles
- Some Inequalities for the Largest Eigenvalue of a Graph
- Über ein Problem von K. Zarankiewicz
- Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
- Bisections of Graphs Without Short Cycles
- Eigenvalues and triangles in graphs
- Extremal Numbers for Odd Cycles
- Sufficient Conditions for Circuits in Graphs†
- On a problem of K. Zarankiewicz
- On the theory of graphs
This page was built for publication: Adjacency eigenvalues of graphs without short odd cycles
