Spectral Bounds for the Connectivity of Regular Graphs with Given Order (Q4685895): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1703.02748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Old and new results on algebraic connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts, girth and a spectral threshold / 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: Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of graphs by degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Security Equals Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with equal algebraic and vertex connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest values of algebraic connectivity for unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity in regular multigraphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for algebraic connectivity based on the connection-graph-stability method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute algebraic connectivity of double brooms and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resilience and survivability in communication networks: strategies, principles, and survey of disciplines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular multigraphs and their application to the Monte Carlo evaluation of moments of non-linear functions of Gaussian random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The six classes of trees with the largest algebraic connectivity / rank
 
Normal rank

Latest revision as of 18:55, 16 July 2024

scientific article; zbMATH DE number 6949377
Language Label Description Also known as
English
Spectral Bounds for the Connectivity of Regular Graphs with Given Order
scientific article; zbMATH DE number 6949377

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    9 October 2018
    0 references
    second-largest eigenvalue
    0 references
    vertex-connectivity
    0 references
    edge-connectivity
    0 references
    regular multigraph
    0 references
    algebraic connectivity
    0 references
    math.CO
    0 references

    Identifiers

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