Quantitative characteristics of cycles and their relations with stretch and spanning tree congestion
Combinatorics
2021-04-19 v1
Abstract
The main goal of this article is to introduce new quantitative characteristics of cycles in finite simple connected graphs and to establish relations of these characteristics with the stretch and spanning tree congestion of graphs. The main new parameter is named the support number. We give a polynomial approximation algorithm for the support number with the aid of yet another characteristic we introduce, named the cycle width of the graph.
Cite
@article{arxiv.2104.07872,
title = {Quantitative characteristics of cycles and their relations with stretch and spanning tree congestion},
author = {Florin Catrina and Rainah Khan and Isaac Moorman and Mikhail Ostrovskii and Lakshmi Iswara Chandra Vidyasagar},
journal= {arXiv preprint arXiv:2104.07872},
year = {2021}
}