Spectral radius, edge-disjoint cycles and cycles of the same length (Q2138553): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques and the spectral radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering non-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4574780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of graphs with no odd wheels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum spectral radius of graphs without friendship subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on graphs without repeated cycle lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some eigenvalue properties in graphs (conjectures of Graffiti -- II) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of graphs without long cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius and Hamiltonian properties of graphs, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Turán problems for even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edge disjoint cliques in graphs of given size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and triangles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral condition for odd cycles in non-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of graphs without repeated cycle lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges in some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacency eigenvalues of graphs without short odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-repeated cycle lengths and Sidon sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral condition for odd cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree powers in graphs with a forbidden even cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum spectral radius of \(C_4\)-free graphs of given order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of graphs without paths and cycles of specified length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new results in extremal graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of the Erdős–Gallai theorem and Luo’s theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum cycle-distributed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of trees on \(k\) pendant vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral extrema of graphs: forbidden hexagon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture on the spectral radius of \(C_4\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost every graph has reconstruction number three / rank
 
Normal rank

Latest revision as of 22:56, 28 July 2024

scientific article
Language Label Description Also known as
English
Spectral radius, edge-disjoint cycles and cycles of the same length
scientific article

    Statements

    Spectral radius, edge-disjoint cycles and cycles of the same length (English)
    0 references
    0 references
    0 references
    0 references
    12 May 2022
    0 references
    Using spectral conditions, the authors give us results about the existence of two edge-disjoint cycles and two cycles of the same length in a graph. The main results are Theorem 2 and 3. These results are not easy to read but the authors divide their proofs into some lemmas and claims. So, they obtain a nice paper. In my opinion, this paper contains excellent results about the relation between spectral graph theory (the spectral radius of a graph) and extremal theory. At the end of the paper, there are open questions and future research.
    0 references
    edge-disjoint cycles
    0 references
    spectral radius of a graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references