A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Explicit Computation of Cheeger Constants for some Classes of Graphs
2019
Journal of Physics, Conference Series
This article deals with the explicit computation of the Cheeger constant and its connection to understanding the properties of some classes of graphs. Cheeger constant is a measure of the connectivity or disconnectivity of graphs and gives the best possible way to cut a graph. More precisely, we deal with the problem of splitting the graph into two large components of approximately equal volumes by making a small cut, which is the idea of Cheeger constant of a graph. We computed the Cheeger
doi:10.1088/1742-6596/1127/1/012064
fatcat:vftmmpgcu5bpvmjzgvbhdusjwm