Lower bounds on the general first Zagreb index of graphs with low cyclomatic number (Q6145808)

From MaRDI portal
Revision as of 14:37, 22 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article; zbMATH DE number 7785856
Language Label Description Also known as
English
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number
scientific article; zbMATH DE number 7785856

    Statements

    Lower bounds on the general first Zagreb index of graphs with low cyclomatic number (English)
    0 references
    0 references
    0 references
    9 January 2024
    0 references
    For a real number \(a\ne 0\), the general first Zagreb index is defined as \[M_1^a(G)=\sum\limits_{v\in V(G)} d_v^a.\] The results of \(M_1^a(G)\) for \(a>0\) have extensiverly been studied. In this paper, the authors prove several results for \(M_1^a(G)\) such that \(a<0\). Several sharp bounds on \(M_1^a(G)\) with \(a<0\) for trees, unicyclic graphs, and bicyclic graphs with given order and maximum degrees are proven. Extremal graphs attaining the bounds are also characterized. Other graphical indices whose degree functions are either convex or concave are also considered in this respect. The main tools authors employ to show their results are extremal set theory and tools from mathematical analysis.
    0 references
    general first Zagreb index
    0 references
    tree
    0 references
    unicyclic graph
    0 references
    bicyclic graph
    0 references
    inverse degree
    0 references
    modified Zagreb index
    0 references
    Narumi-Katayama index
    0 references
    modified Narumi-Katayama index
    0 references

    Identifiers

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