Abstract
A graph is closed when its vertices have a labeling by with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings and clustering coefficients.
Citation
David A. Cox. Andrew Erskine. "On closed graphs, II." Involve 9 (2) 333 - 345, 2016. https://doi.org/10.2140/involve.2016.9.333
Information