Eigenvalues and triangles in graphs
From MaRDI portal
Publication:4993261
DOI10.1017/S0963548320000462zbMath1466.05121arXiv1910.12474OpenAlexW3090797620MaRDI QIDQ4993261
Bo Ning, Huiqiu Lin, Baoyindureng Wu
Publication date: 15 June 2021
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.12474
Related Items (46)
The general spectral radii of (multicone-)graphs with prescribed degree sequence ⋮ Signless Laplacian spectral radius of graphs without short cycles or long cycles ⋮ Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals ⋮ The maximum outdegree power of complete \(k\)-partite oriented graphs ⋮ Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size ⋮ 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 ⋮ On the spectral radius of minimally 2-(edge)-connected graphs with given size ⋮ The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ On a generalization of the spectral Mantel's theorem ⋮ Spectral extremal graphs for the bowtie ⋮ Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\) ⋮ Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size ⋮ The sum of the \(k\) largest distance eigenvalues of graphs ⋮ Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size ⋮ Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1 ⋮ Refinement on Spectral Turán’s Theorem ⋮ Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles ⋮ Spectral radius of graphs of given size with forbidden subgraphs ⋮ Two conjectured strengthenings of Turán's theorem ⋮ Signed spectral Turań-type theorems ⋮ On the first two eigenvalues of regular graphs ⋮ Maximum degree and spectral radius of graphs in terms of size ⋮ Maxima of the \(Q\)-index of non-bipartite \(C_3\)-free graphs ⋮ The index of signed graphs with forbidden subgraphs ⋮ On the sum of the k largest absolute values of Laplacian eigenvalues of digraphs ⋮ Maximizing the degree powers of graphs with fixed size ⋮ Some extremal problems on \(A_\alpha \)-spectral radius of graphs with given size ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius ⋮ A spectral extremal problem on non-bipartite triangle-free graphs ⋮ Spectral radius of graphs with given size and odd girth ⋮ Maxima of the \(A_\alpha\)-index of graphs with given size and domination number ⋮ The maximum spectral radius of graphs of given size with forbidden subgraph ⋮ A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs ⋮ Counting substructures and eigenvalues. I: Triangles ⋮ Unnamed Item ⋮ A spectral version of Mantel's theorem ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ A spectral condition for odd cycles in non-bipartite graphs ⋮ Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs ⋮ A spectral condition for the existence of a pentagon in non-bipartite graphs ⋮ Degree powers in \(K_{s,t}\)-minor free graphs ⋮ Spectral radius and the 2-power of Hamilton cycle ⋮ The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjectured bounds for the sum of squares of positive eigenvalues of a graph
- Proof of a conjectured lower bound on the chromatic number of a graph
- Lower bounds for the clique and the chromatic numbers of a graph
- Walks and the spectral radius of graphs
- A lower bound for the spectral radius of graphs with fixed diameter
- Matchings in regular graphs from eigenvalues
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- More spectral bounds on the clique and independence numbers
- Spectral bounds for the clique and independence numbers of graphs
- Eigenvalues and expanders
- Spectral radius and \(k\)-connectedness of a graph
- Eigenvalues and perfect matchings
- Bounds of eigenvalues of a graph
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- A sharp upper bound of the spectral radius of graphs
- Hamilton cycles and eigenvalues of graphs
- On the largest eigenvalue of non-regular graphs
- Three conjectures in extremal spectral graph theory
- Bipartite subgraphs
- Cliques and the spectral radius
- Regular Graphs, Eigenvalues and Regular Factors
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Bipartite graphs with at most six non-zero eigenvalues
- Some new results in extremal graph theory
- Some Inequalities for the Largest Eigenvalue of a Graph
- Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
- Linear Separation of Dominating Sets in Graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
This page was built for publication: Eigenvalues and triangles in graphs
