1. KHALID HAMID - PhD Scholar, Department of Computer Science, Superior University, Lahore, Pakistan
and Lecturer Computer Science at NCBA & E East Canal Campus, Lahore.
2. HAFIZ ABDUL BASIT MUHAMMAD - PhD Scholar, Department of Computer Science, Superior University, Lahore, Pakistan
and Lecturer Computer Science at Minhaj University, Lahore.
3. MUHAMMAD WASEEM IQBAL - Associate Professor, Computer Science, Department of Software Engineering, Superior
University, Lahore, Pakistan.
4. M AMEER HAMZA - Lecturer, Computer Science, Department of Computer Science, Superior University,
Lahore, Pakistan.
5. SALMAN UBAID BHATTI - Lecturer Computer Science, Department of Computer Science, SABAC College,
Lahore, Pakistan.
6. MUHAMMAD AQEEL - Department of Software Engineering, Superior University, Lahore, Pakistan.
A bridge network is a network consisting of two or more computer networks bridged together. These are applicable in many fields like interconnections networks of memory, microprocessors, power generations, and chemical compounds Secondly, any number that can be uniquely determined by a graph is called a graph invariant. Bridge networks are directly related to graph invariants as these networks can be expressed in terms of a graph. During the last few decades, 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 to a network graph or computer networks. In this paper, the study will discuss three different variants of bridge networks like the tree, cyclic and fully connected networks embedded with bus networks and calculate them with the help of Dharwad Indices in the context of topologies.
Bridge networks, network graph, invariants, maple, Dharwad indices, interconnections networks, Computer Architecture.