Estimating the First, Hyper-Zagreb Index for Direct Product of F-Sum Graphs

A chemical graph is an illustration of a chemical compound’s structural formula, where the edges indicate covalent bonding and the vertices depict atoms. In the study of (molecular) graphs, Zagreb indices and their variations are the most studied and well-investigated invariants due to their chemical applicability. To probe and investigate the most promising lower and upper bound of the appropriate topological index for a graph family is a problem of primal significance in extremal graph theory. Deng et al. computed the closed-form formulas for the Zagreb indices M1 and M2 for four novel operations known as F-sum graphs, proposed by Eliasi and Taeri in “Discrete Appl. Math. (2009) 157.” Subsequently, Buragohain et al. derived the formulas for M1 and M2 of four sum graphs in the context of the direct product. In this article, we investigate F-sum graphs formed through four newly defined graph operations associated with the direct product and establish lower bounds and upper bounds on the first hyper-Zagreb index HM1 for these graphs. Finally, we validate our derived bounds by applying them to various examples, demonstrating the correctness and applicability of the results.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-12-23
DOI
https://doi.org/10.3390/math14010051
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Estimating the First, Hyper-Zagreb Index for Direct Product of F-Sum Graphs

Suha Wazzan, Rauf Irshad
Mathematics
Graph theory and applications
article

Estimating the First, Hyper-Zagreb Index for Direct Product of F-Sum Graphs

Suha Wazzan, Rauf Irshad
article en

Abstract

A chemical graph is an illustration of a chemical compound’s structural formula, where the edges indicate covalent bonding and the vertices depict atoms. In the study of (molecular) graphs, Zagreb indices and their variations are the most studied and well-investigated invariants due to their chemical applicability. To probe and investigate the most promising lower and upper bound of the appropriate topological index for a graph family is a problem of primal significance in extremal graph theory. Deng et al. computed the closed-form formulas for the Zagreb indices M1 and M2 for four novel operations known as F-sum graphs, proposed by Eliasi and Taeri in “Discrete Appl. Math. (2009) 157.” Subsequently, Buragohain et al. derived the formulas for M1 and M2 of four sum graphs in the context of the direct product. In this article, we investigate F-sum graphs formed through four newly defined graph operations associated with the direct product and establish lower bounds and upper bounds on the first hyper-Zagreb index HM1 for these graphs. Finally, we validate our derived bounds by applying them to various examples, demonstrating the correctness and applicability of the results.

MathematicsVol. 14(1)
COMSATS University Islamabad (PK), King Abdulaziz University (SA)
King Abdulaziz University
Openalex Percentile: Top 22%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.