K-Banhatti Sombor Invariants of Certain Computer Networks

Abstract

Any number that can be uniquely determined by a graph is called a graph invariant. During the last twenty years' countless mathematical graph invariants have been characterized and utilized for correlation analysis. However, no reliable examination has been embraced to decide, how much these invariants are related with a network graph or molecular graph. In this paper, it will discuss three different variants of bridge networks with good potential of prediction in the field of computer science, mathematics, chemistry, pharmacy, informatics and biology in context with physical and chemical structures and networks, because k-banhatti sombor invariants are freshly presented and have numerous prediction qualities for different variants of bridge graphs or networks. The study solved the topology of a bridge graph/networks of three different types with two invariants KBanhatti Sombor Indices and its reduced form. These deduced results can be used for the modeling of computer networks like Local area network (LAN), Metropolitan area network (MAN), andWide area network (WAN), backbone of internet and other networks/structures of computers, power generation, bio-informatics and chemical compounds synthesis.