Spectral radius, edge-disjoint cycles and cycles of the same length
From MaRDI portal
Publication:2138553
DOI10.37236/10783zbMath1493.05193arXiv2108.09057OpenAlexW3195369803MaRDI QIDQ2138553
Yanhua Zhao, Huiqiu Lin, Ming-qing Zhai
Publication date: 12 May 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.09057
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items
Spectral extrema of graphs with bounded clique number and matching number, Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles, Maxima of the \(Q\)-index of non-bipartite \(C_3\)-free graphs, An old problem of Erdős: a graph without two cycles of the same length, Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Spectra of graphs
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Spectral extrema of graphs: forbidden hexagon
- 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 maximum cycle-distributed graphs
- On the number of edge disjoint cliques in graphs of given size
- Degrees and matchings
- The spectral radius of graphs without long cycles
- The spectral radius of trees on \(k\) pendant vertices
- Covering non-uniform hypergraphs
- Non-repeated cycle lengths and Sidon sequences
- On the number of edges in some graphs
- Generalized Turán problems for even cycles
- The maximum spectral radius of graphs without friendship subgraphs
- Adjacency eigenvalues of graphs without short odd cycles
- The spectral radius of graphs with no odd wheels
- A spectral condition for odd cycles in non-bipartite graphs
- Degree powers in graphs with a forbidden even cycle
- On the size of graphs without repeated cycle lengths
- A spectral condition for odd cycles in graphs
- Cliques and the spectral radius
- Some new results in extremal graph theory
- Almost every graph has reconstruction number three
- Note on graphs without repeated cycle lengths
- Eigenvalues and triangles in graphs
- Spectral radius and Hamiltonian properties of graphs, II
- Extensions of the Erdős–Gallai theorem and Luo’s theorem
- On Independent Circuits Contained in a Graph