On Hamiltonian graphs with maximal index (Q1123901): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the index of tricyclic Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of (0,1)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spektren endlicher Grafen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results in the theory of graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A table of connected graphs on six vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3261425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deletion-contraction algorithm for the characteristic polynomial of a multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal index of graphs with a prescribed number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724663 / rank
 
Normal rank

Latest revision as of 09:14, 20 June 2024

scientific article
Language Label Description Also known as
English
On Hamiltonian graphs with maximal index
scientific article

    Statements

    On Hamiltonian graphs with maximal index (English)
    0 references
    0 references
    1989
    0 references
    For each natural number \(q\geq 3\), the author determines the unique Hamiltonian graph with q edges for which the largest eigenvalue of the adjacency matrix is largest possible.
    0 references
    Hamiltonian graph
    0 references
    largest eigenvalue
    0 references
    adjacency matrix
    0 references

    Identifiers