On Trees with a Given Number of Vertices of Fixed Degree and Their Two Bond Incident Degree Indices

This paper is mainly concerned with the study of two bond incident degree (BID) indices, namely the variable sum exdeg index SEIa and the general zeroth-order Randić index Rα0. The minimum values of SEIa and Rα0 in the class of all trees of fixed order containing no vertex of even degree are obtained for a>1 and α∈[0,1]; also, the maximum value of Rα0 in the mentioned class is determined for 0<α<1. Moreover, in the family of all trees of fixed order and with a given number of vertices of even degrees, the extremum values of SEIa and Rα0 are found for every real number α∉{0,1} and a>1. Furthermore, in the class of all trees of fixed order and with a given number of vertices of maximum degree, the minimum values of SEIa and Rα0 are determined when a>1 and α does not belong to the closed interval [0,1]; in the same class, the maximum values of Rα0 are also found for 0<α<1. The graphs that achieve the obtained extremal values are also determined.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2024-12-30
DOI
https://doi.org/10.3390/axioms14010023
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
OCT
article

On Trees with a Given Number of Vertices of Fixed Degree and Their Two Bond Incident Degree Indices

Hicham Saber, Tariq Alraqad, Akhlaq Ahmad Bhatti, Akbar Ali et al.
Axioms
Graph theory and applications
article

On Trees with a Given Number of Vertices of Fixed Degree and Their Two Bond Incident Degree Indices

Hicham Saber, Tariq Alraqad, Akhlaq Ahmad Bhatti, Akbar Ali, İvan Gutman, Abeer M. Albalahi, Muhammad Rizwan
article en

Abstract

This paper is mainly concerned with the study of two bond incident degree (BID) indices, namely the variable sum exdeg index SEIa and the general zeroth-order Randić index Rα0. The minimum values of SEIa and Rα0 in the class of all trees of fixed order containing no vertex of even degree are obtained for a>1 and α∈[0,1]; also, the maximum value of Rα0 in the mentioned class is determined for 0<α<1. Moreover, in the family of all trees of fixed order and with a given number of vertices of even degrees, the extremum values of SEIa and Rα0 are found for every real number α∉{0,1} and a>1. Furthermore, in the class of all trees of fixed order and with a given number of vertices of maximum degree, the minimum values of SEIa and Rα0 are determined when a>1 and α does not belong to the closed interval [0,1]; in the same class, the maximum values of Rα0 are also found for 0<α<1. The graphs that achieve the obtained extremal values are also determined.

AxiomsVol. 14(1)
University of Kragujevac (RS), National University of Computer and Emerging Sciences (PK), University of Ha'il (SA)
Openalex Percentile: Top 62%
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.