On bicyclic graphs with maximal energy (Q2383019): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3807048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unicyclic graphs with minimal energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicyclic graphs with minimum energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unicyclic graphs with maximal energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5462768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bicyclic graphs with minimal energies / rank
 
Normal rank

Latest revision as of 09:32, 27 June 2024

scientific article
Language Label Description Also known as
English
On bicyclic graphs with maximal energy
scientific article

    Statements

    On bicyclic graphs with maximal energy (English)
    0 references
    0 references
    0 references
    5 October 2007
    0 references
    The energy of a graph is the sum the absolute values of its eigenvalues. The main result of the article is the construction of the graph with maximal energy in the set of bicyclic graphs. This result gives a partial solution to Gutman's conjecture for molecular graphs with maximal energy.
    0 references
    maximal energy
    0 references
    characteristic polynomial
    0 references
    eigenvalue
    0 references

    Identifiers

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