Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963305315 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1602.05922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough Ramsey graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness in graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3127430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and spectrum of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small spectral gap in the combinatorial Laplacian implies Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and edge-connectivity of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in regular graphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum and toughness of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and eigenvalues of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the size of graphs of given order and \(l\)-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, trees, and walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral conditions for edge connectivity and packing spanning trees in multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular factors and eigenvalues of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of minimally \((2,l)\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse pseudo‐random graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic conditions for t-tough graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on edge-disjoint spanning trees and eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Graphs, Eigenvalues and Regular Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular factors of regular graphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(\ell\)-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a connection between the existence of k-trees and the toughness of a graph / rank
 
Normal rank

Latest revision as of 20:17, 12 July 2024

scientific article
Language Label Description Also known as
English
Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
scientific article

    Statements

    Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (English)
    0 references
    0 references
    0 references
    26 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    spectral graph theory
    0 references
    eigenvalue
    0 references
    connectivity
    0 references
    toughness
    0 references
    spanning \(k\)-tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references