Local Value of a Vertex-Degree Function Index of a Graph

Let n be a positive integer and f a real function defined on integers in the interval [1, n -1].Given a graph G with vertex set V and n non-isolated vertices, the degree-function index of G is defined as H f (G) = uV f (du).It is our main objective in this paper to introduce the local value of a degree-function index H f of a graph G at a vertex u, which we denote by fG (u).Intutively, fG (u) measures the contribution of vertex u in H f (G).In this paper we initiate the study of its mathematical properties and address the problem of vertices with extremal local values in the zeroth-order general Randi index.In particular, for the first Zagreb index and the forgotten index, the problem of vertices with extremal local values is completely solved.

Authors

Institutions

Publication Details

Journal
match Communications in Mathematical and in Computer Chemistry
Published
2025-01-01
DOI
https://doi.org/10.46793/match95-1.28124
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Local Value of a Vertex-Degree Function Index of a Graph

Juan Rada
match Communications in Mathematical and in Computer Chemistry
Graph Labeling and Dimension Problems
article

Local Value of a Vertex-Degree Function Index of a Graph

Juan Rada
article en

Abstract

Let n be a positive integer and f a real function defined on integers in the interval [1, n -1].Given a graph G with vertex set V and n non-isolated vertices, the degree-function index of G is defined as H f (G) = uV f (du).It is our main objective in this paper to introduce the local value of a degree-function index H f of a graph G at a vertex u, which we denote by fG (u).Intutively, fG (u) measures the contribution of vertex u in H f (G).In this paper we initiate the study of its mathematical properties and address the problem of vertices with extremal local values in the zeroth-order general Randi index.In particular, for the first Zagreb index and the forgotten index, the problem of vertices with extremal local values is completely solved.

match Communications in Mathematical and in Computer ChemistryVol. 95(1)
Universidad de Antioquia (CO)
Openalex Percentile: Top 84%
Graph Labeling and Dimension Problems
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.