On Local Fractional Topological Indices and Entropies for Hyper-Chordal Ring Networks Using Local Fractional Metric Dimension

An algebraic graph is defined in terms of graph theory as a graph with related algebraic structures or characteristics. If the vertex set of a graph G is a group, a ring, or a field, then G is called an algebraic structure graph. This work uses an algebraic structure graph based on the modular ring Zn, known as a hyper-chordal ring network. The lower and upper bounds of the local fractional metric dimension are computed for certain families of hyper-chordal ring networks. Utilizing the cardinalities of local fractional resolving sets, local fractional resolving (LFR)M-polynomials are computed for hyper-chordal ring networks. Further, new topological indices based on (LFR)M-polynomials are established for the proposed networks. The local fraction entropies are developed by modifying the first three kinds of Zagreb entropies, which are calculated for the chosen hyper-chordal ring networks. Furthermore, numerical and graphical comparisons are discussed to observe the order between newly computed topological indices.

Authors

Institutions

Publication Details

Journal
Symmetry
Published
2024-12-24
DOI
https://doi.org/10.3390/sym17010005
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

On Local Fractional Topological Indices and Entropies for Hyper-Chordal Ring Networks Using Local Fractional Metric Dimension

Shahbaz Ali, Amal S. Alali, Shahzaib Ashraf, Shahzad Ali et al.
Symmetry
Graph Labeling and Dimension Problems
article

On Local Fractional Topological Indices and Entropies for Hyper-Chordal Ring Networks Using Local Fractional Metric Dimension

Shahbaz Ali, Amal S. Alali, Shahzaib Ashraf, Shahzad Ali, Abdullah Afzal
article en

Abstract

An algebraic graph is defined in terms of graph theory as a graph with related algebraic structures or characteristics. If the vertex set of a graph G is a group, a ring, or a field, then G is called an algebraic structure graph. This work uses an algebraic structure graph based on the modular ring Zn, known as a hyper-chordal ring network. The lower and upper bounds of the local fractional metric dimension are computed for certain families of hyper-chordal ring networks. Utilizing the cardinalities of local fractional resolving sets, local fractional resolving (LFR)M-polynomials are computed for hyper-chordal ring networks. Further, new topological indices based on (LFR)M-polynomials are established for the proposed networks. The local fraction entropies are developed by modifying the first three kinds of Zagreb entropies, which are calculated for the chosen hyper-chordal ring networks. Furthermore, numerical and graphical comparisons are discussed to observe the order between newly computed topological indices.

SymmetryVol. 17(1)
Princess Nourah bint Abdulrahman University (SA), Islamia University of Bahawalpur (PK), Khwaja Fareed University of Engineering and Information Technology (PK)
Openalex Percentile: Top 72%
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.

On Local Fractional Topological Indices and Entropies for Hyper-Chordal Ring Networks Using Local Fractional Metric Dimension — Shahbaz Ali, Amal S. Alali, et al. · Symmetry (2024) | TGRS Research Map | TGRS