Spectral diameter estimates for \(k\)-regular graphs (Q1333236): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Gregory T. Quenell / rank
Normal rank
 
Property / author
 
Property / author: Gregory T. Quenell / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/aima.1994.1052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049518778 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:14, 19 March 2024

scientific article
Language Label Description Also known as
English
Spectral diameter estimates for \(k\)-regular graphs
scientific article

    Statements

    Spectral diameter estimates for \(k\)-regular graphs (English)
    0 references
    1994
    0 references
    An upper bound for the diameter of a regular graph, which depends on the second largest eigenvalue (in modulus) of the adjacency matrix and on the girth, is derived.
    0 references
    upper bound
    0 references
    diameter
    0 references
    regular graph
    0 references
    eigenvalue
    0 references
    adjacency matrix
    0 references
    girth
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references