Jul 2026· International Journal of Drug Delivery Technology· Vol 16· 0 citations
Abstract
Eccentricity-based topological indices are valuable descriptors for analyzing molecular graphs and
complex networks. This paper focuses on the complement of the Mycielskian graph of a connected graph. We
derive new upper bounds for several recently introduced eccentricity-related topological indices by exploiting the
structural characteristics of the complement graph. The obtained inequalities improve the theoretical
understanding of these descriptors and provide efficient estimates for transformed graphs. The proposed results
offer new insights into complement graph theory and support further applications in chemical graph theory and
related fields.
Topological descriptors based on Revan vertex degrees provide an effective framework for analyzing the structural characteristics of complex graphs. This work investigates Revan degree-based topological indices for generalized thorn cog graphs, including the first and second Revan indices, the Atom-Bond Connectivity Re...
K. Saranya, S. Manimekalai· The Nepali Mathematical Scie...· 0 citations
Neighbourhood degree-based topological indices have emerged as an important class of molecular descriptors in graph theory due to their ability to incorporate not only the degree of a vertex but also the degree information of its adjacent vertices. In comparison with conventional degree-based indices, they provide a mo...
P. S., S. Kopperundevi· RCHUB JOURNAL OF COMPUTATION...· 0 citations
Topological indices can be used to characterize molecular topology. These are numerical measurements of a suggested molecule’s fundamental structural characteristics, derived from its molecular structure. This numerical value, which is derived from a chemical configuration, represents the important physical properties...
Jayavel Pooja, Venkatesan Muthukumaran, B. Rather et al.· Discrete Mathematics, Algori...· 0 citations
Wiener-type distance-based topological indices (Wiener, Wiener polarity, hyper-Wiener, Harary, reciprocal complementary Wiener, and terminal Wiener) are discussed and recalculated by considering the odd and even cases of n.
H. Topcu, Eda Güner· Eskişehir Teknik Üniversites...· 0 citations
By decomposing the k-distance product G \square_k H of two graphs G and H into the Cartesian product of graph powers, we determine its exact edge connectivity \kappa'. Leveraging this result, we completely formulate edge connectivity for k-distance products of path-path, cycle-cycle, and hybrid path-cycle graph pairs a...
S. Panma, K. Poochinapan, Tanapat Chalarux· International Journal of Mat...· 0 citations
In this paper, we provide the upper bound on the energy of a graph using the Diaz-metcalf inequality. Then, we obtained several bounds on the energy of a graph with given invariants such as order, size, diameter, radius, girth, kirchoff index, clique number, algebraic connectivity, vertex connectivity, index, etc. Fina...
