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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: General sum-connectivity index of unicyclic graphs with given diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the irregularity of trees and unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5156344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Wiener indices of trees with given number of vertices of maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal augmented Zagreb index of trees with given numbers of vertices and leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the sum of squares of degrees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4994266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5012974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A forgotten topological index / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reduced second Zagreb index of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2869493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3144346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4928204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical analyses of a class of random pentagonal chain networks with respect to several topological properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistical analysis for Sombor indices in a random polygonal chain networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the entire Zagreb indices of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum of the squares of degrees: sharp asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5165181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal vertex-degree function index for trees and unicyclic graphs with given independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some extremal graphs with respect to inverse degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2975350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formula with its applications on the difference of Zagreb indices of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5299402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409960 / rank
 
Normal rank

Revision as of 14:37, 22 August 2024

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