Abstract

Any number that can be uniquely determined by a graph is called graph invariants. During the most recent twenty years’ innumerable numerical graph invariants have been described and used for correlation analysis. In the fast and advanced environment of manufacturing of networks and other products which used different networks, no dependable assessment has been embraced to choose, how much these invariants are connected with a network graph or molecular graph. In this paper, it will talk about three distinct variations of bridge networks with great capability of expectation in the field of computer science, chemistry, physics, drug industry, informatics, and mathematics in setting with physical and synthetic constructions and networks, since K-Banhatti invariants are newly introduced and have various forecast characteristics for various variations of bridge graphs or networks. The review settled the topology of bridge graph/networks of three unique sorts with three types of K-Banhatti Indices. These concluded outcomes can be utilized for the modeling of interconnection networks of Personal computers (PC), networks like Local area network (LAN), Metropolitan area network (MAN) and Wide area network (WAN), the spine of internet and different networks/designs of PCs, power generation interconnection, bio-informatics and chemical structures.

Details

Title
K-Banhatti Invariants Empowered Topological Investigation of Bridge Networks
Author
Hamid, Khalid; Muhammad Waseem Iqbal; Erssa Arif; Mahmood, Yasir; Khan, Ahmad Salman; Nazri Kama; Azmi, Azri; Ikram, Atif
Pages
5423-5440
Section
ARTICLE
Publication year
2022
Publication date
2022
Publisher
Tech Science Press
ISSN
1546-2218
e-ISSN
1546-2226
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2696965512
Copyright
© 2022. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.