Academic Journal
Προβολή σε EDS

Exponential Zagreb indices and operations on graphs.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Exponential Zagreb indices and operations on graphs.
Συγγραφείς: Azari, Mahdieh1 (AUTHOR) mahdieh.azari@iau.ac.ir, Dehgardi, Nasrin2 (AUTHOR) n.dehgardi@sirjantech.ac.ir
Πηγή: Discrete Mathematics, Algorithms & Applications. Aug2026, Vol. 18 Issue 7, p1-21. 21p.
Θεματικοί όροι: *Graph theory, *Regular graphs
Περίληψη: The concept of the exponential of vertex-degree-based invariants was put forward by Rada [Exponential vertex-degree-based topological indices and discrimination, MATCH Commun. Math. Comput. Chem. 82(1) (2019) 29–41] with the purpose of investigating the discriminating ability of this category of topological indices. In view of this, the exponential of the two well-known Zagreb indices are formulated for a simple connected graph G as e M 1 (G) = ∑ x ∈ V G e d G 2 (x) and e M 2 (G) = ∑ x x ′ ∈ E G e d G (x) d G (x ′) , where V G and E G stand for the vertex set and edge set of G , respectively, and d G (x) indicates the degree of the vertex x in G. In this paper, we give sharp upper and lower bounds on the exponential Zagreb indices of several families of graph operations such as the sum, Indu–Bala product, vertex-corona product, edge-corona product, Cartesian product, strong product, and lexicographic product in terms of the exponential Zagreb indices and some graph parameters of their factors. The necessary and sufficient conditions for the inequalities to be transformed into equality are also examined. In the special case that both factors are regular graphs, exact formulas for the exponential Zagreb indices of all aforementioned operations are provided. The obtained results are illustrated by several interesting examples from certain special families of graphs. [ABSTRACT FROM AUTHOR]
Βάση Δεδομένων: Academic Search Index
FullText Text:
  Availability: 0
Header DbId: asx
DbLabel: Academic Search Index
An: 196345328
RelevancyScore: 1452
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1452.42504882813
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Exponential Zagreb indices and operations on graphs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Azari%2C+Mahdieh%22">Azari, Mahdieh</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> mahdieh.azari@iau.ac.ir</i><br /><searchLink fieldCode="AR" term="%22Dehgardi%2C+Nasrin%22">Dehgardi, Nasrin</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> n.dehgardi@sirjantech.ac.ir</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Mathematics%2C+Algorithms+%26+Applications%22">Discrete Mathematics, Algorithms & Applications</searchLink>. Aug2026, Vol. 18 Issue 7, p1-21. 21p.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br />*<searchLink fieldCode="DE" term="%22Regular+graphs%22">Regular graphs</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The concept of the exponential of vertex-degree-based invariants was put forward by Rada [Exponential vertex-degree-based topological indices and discrimination, MATCH Commun. Math. Comput. Chem. 82(1) (2019) 29–41] with the purpose of investigating the discriminating ability of this category of topological indices. In view of this, the exponential of the two well-known Zagreb indices are formulated for a simple connected graph G as e M 1 (G) = ∑ x ∈ V G e d G 2 (x) and e M 2 (G) = ∑ x x ′ ∈ E G e d G (x) d G (x ′) , where V G and E G stand for the vertex set and edge set of G , respectively, and d G (x) indicates the degree of the vertex x in G. In this paper, we give sharp upper and lower bounds on the exponential Zagreb indices of several families of graph operations such as the sum, Indu–Bala product, vertex-corona product, edge-corona product, Cartesian product, strong product, and lexicographic product in terms of the exponential Zagreb indices and some graph parameters of their factors. The necessary and sufficient conditions for the inequalities to be transformed into equality are also examined. In the special case that both factors are regular graphs, exact formulas for the exponential Zagreb indices of all aforementioned operations are provided. The obtained results are illustrated by several interesting examples from certain special families of graphs. [ABSTRACT FROM AUTHOR]
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=asx&AN=196345328
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1142/S1793830925501058
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 1
    Subjects:
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Regular graphs
        Type: general
    Titles:
      – TitleFull: Exponential Zagreb indices and operations on graphs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Azari, Mahdieh
      – PersonEntity:
          Name:
            NameFull: Dehgardi, Nasrin
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 08
              Text: Aug2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 17938309
          Numbering:
            – Type: volume
              Value: 18
            – Type: issue
              Value: 7
          Titles:
            – TitleFull: Discrete Mathematics, Algorithms & Applications
              Type: main
ResultId 1