Maximizing Closeness in Bipartite Networks: A Graph-Theoretic Analysis

• Published in: Mathematics (Basel) Vol. 12; no. 13; p. 2039
• Main Authors: Hayat, Fazal, Otera, Daniele Ettore
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.07.2024
• Subjects: bipartite graph; closeness; Codes; Connectivity; cut edge; diameter; dissociation number; Graph theory; Graphs; Network analysis; Nodes; Parameter identification

A fundamental aspect of network analysis involves pinpointing nodes that hold significant positions within the network. Graph theory has emerged as a powerful mathematical tool for this purpose, and there exist numerous graph-theoretic parameters for analyzing the stability of the system. Within thi...