Closeness and Decision Making
Discrete Mathematics
2026-03-17 v1
Abstract
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.
Cite
@article{arxiv.2603.14922,
title = {Closeness and Decision Making},
author = {Chavdar Dangalchev},
journal= {arXiv preprint arXiv:2603.14922},
year = {2026}
}
Comments
20 pages, 5 figures, 1 table