Please use this identifier to cite or link to this item:
Title: Some vertex/edge-degree-based topological indices of r-apex trees
Authors: Akbar Ali
Waqas Iqbal
Zahid Raza
Ekram E. Ali
Liu, Jia-Bao
Farooq Ahmad
Qasim Ali Chaudhry
Keywords: Engineering::Mechanical engineering
Issue Date: 2021
Source: Akbar Ali, Waqas Iqbal, Zahid Raza, Ekram E. Ali, Liu, J., Farooq Ahmad & Qasim Ali Chaudhry (2021). Some vertex/edge-degree-based topological indices of r-apex trees. Journal of Mathematics, 2021, 4349074-.
Journal: Journal of Mathematics
Abstract: In chemical graph theory, graph invariants are usually referred to as topological indices. For a graph G, its vertex-degree-based topological indices of the form BIDG=∑uv∈EGβdu,dv are known as bond incident degree indices, where EG is the edge set of G, dw denotes degree of an arbitrary vertex w of G, and β is a real-valued-symmetric function. Those BID indices for which β can be rewritten as a function of du+dv-2 (that is degree of the edge uv) are known as edge-degree-based BID indices. A connected graph G is said to be r-apex tree if r is the smallest nonnegative integer for which there is a subset R of VG such that R=r and G-R is a tree. In this paper, we address the problem of determining graphs attaining the maximum or minimum value of an arbitrary BID index from the class of all r-apex trees of order n, where r and n are fixed integers satisfying the inequalities n-r≥2 and r≥1.
ISSN: 2314-4629
DOI: 10.1155/2021/4349074
Rights: © 2021 Akbar Ali et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:MAE Journal Articles

Files in This Item:
File Description SizeFormat 
4349074.pdf1.33 MBAdobe PDFView/Open

Page view(s)

Updated on May 27, 2022


Updated on May 27, 2022

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.