2015/01/31 by David A. Cox, Andrew Erskine
Mathematics · #math.CO #msc:05C25 #msc:05C75 #msc:05C78
paper · pdf · doi:10.2140/involve.2016.9.333
published as Involve 9 (2016) 333-345 · The article "On closed graphs" arXiv:1306.5149v1 was divided into two parts. The first part, "On closed graphs I", will become v2 of the previous submission, while the second part, "On closed graphs II" is the paper submitted here. The new version of "On closed graphs II" corrects some minor typographical errors
arxiv created 2015/04/22 · arxiv updated 2016/03/09
A graph is closed when its vertices have a labeling by [n] 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.