Further Properties of the Vertex-Block Zagreb Indices of Graphs

A topological index is a graph invariant with applications in chemistry. The first and second Zagreb indices are degree-based topological indices of molecular graphs. A block of a graph G is a maximal connected subgraph of G that contains no cut-vertex. The vb-degree of a vertex is defined as the number of blocks incident to it. The first and second vertex-block Zagreb indices, denoted by VBM 1 (G) and VBM 2 (G), respectively, are vb-degree-based topological indices. In this paper, we determine the graphs that attain the maximum and minimum values of the first and second vertex-block Zagreb indices among all graphs with a given number of vertices and blocks. Furthermore, we establish lower and upper bounds for VBM 1 (G) and VBM 2 (G) in terms of the number of vertices, the number of blocks, the maximum block order, and the maximum vb-degree of a graph. We also characterize the extremal graphs attaining these bounds.

Authors

Publication Details

Journal
Asian-European Journal of Mathematics
Published
2026-09-11
DOI
https://doi.org/10.1142/s1793557126501238
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

Further Properties of the Vertex-Block Zagreb Indices of Graphs

N. Prathviraj, Sayinath Udupa Nagara Vinayaka, Anusha Laxmana
Asian-European Journal of Mathematics
Graph theory and applications
article

Further Properties of the Vertex-Block Zagreb Indices of Graphs

N. Prathviraj, Sayinath Udupa Nagara Vinayaka, Anusha Laxmana
article en

Abstract

A topological index is a graph invariant with applications in chemistry. The first and second Zagreb indices are degree-based topological indices of molecular graphs. A block of a graph G is a maximal connected subgraph of G that contains no cut-vertex. The vb-degree of a vertex is defined as the number of blocks incident to it. The first and second vertex-block Zagreb indices, denoted by VBM 1 (G) and VBM 2 (G), respectively, are vb-degree-based topological indices. In this paper, we determine the graphs that attain the maximum and minimum values of the first and second vertex-block Zagreb indices among all graphs with a given number of vertices and blocks. Furthermore, we establish lower and upper bounds for VBM 1 (G) and VBM 2 (G) in terms of the number of vertices, the number of blocks, the maximum block order, and the maximum vb-degree of a graph. We also characterize the extremal graphs attaining these bounds.

Asian-European Journal of Mathematics
Openalex Percentile: Top 6%
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.