Cut Bounds for Some Weighted Graphs
Combinatorics
2020-09-30 v2
Abstract
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which minimize some forms of graph cut. Previous research already gave some results about the cut bounds for unweighted regular graph. In this paper, we prove a result about the lower bound for weighted graphs that have some regular properties and show similar results for more general case.
Keywords
Cite
@article{arxiv.2009.12003,
title = {Cut Bounds for Some Weighted Graphs},
author = {Chicheng Ma and Yucong Tang and Guanghui Wang and Guiying Yan and Bo Bai},
journal= {arXiv preprint arXiv:2009.12003},
year = {2020}
}
Comments
In section 1, two results(theorem 5 and theorem) can be improved and there is some work to be done