Graphs with given diameter maximizing the algebraic connectivity (Q603120): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2010.06.051 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2124303753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization in scale-free dynamical networks: robustness and fragility / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with given diameter maximizing the spectral radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Spectral Integral Variations of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Analysis of Communications Networks and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Spectrum of a Graph II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo / 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: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank

Latest revision as of 11:03, 3 July 2024

scientific article
Language Label Description Also known as
English
Graphs with given diameter maximizing the algebraic connectivity
scientific article

    Statements

    Graphs with given diameter maximizing the algebraic connectivity (English)
    0 references
    5 November 2010
    0 references
    graphs
    0 references
    algebraic connectivity
    0 references
    maximize
    0 references
    diameter
    0 references
    0 references
    0 references
    0 references

    Identifiers