Closeness and Decision Making
This work provides incremental insights into network optimization for researchers in graph theory or network analysis, focusing on theoretical criteria without broad practical applications.
The paper addresses the problem of selecting a new link to add to a network after one link is broken, aiming to optimize closeness under various criteria, and analyzes this for specific graph structures like cycles, paths, lollipop graphs, and two complete graphs connected by a link.
In this article we consider networks, which for a given time period can have one link broken. Which new link should we build so the closeness of the resulting network satisfies some optimal criteria? We consider different criteria for optimization and different graphs: cycle, paths, lollipop graphs, and two complete graphs, connected by a link.