Open Access
2016 On closed graphs, II
David A. Cox, Andrew Erskine
Involve 9(2): 333-345 (2016). DOI: 10.2140/involve.2016.9.333


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.


Download Citation

David A. Cox. Andrew Erskine. "On closed graphs, II." Involve 9 (2) 333 - 345, 2016.


Received: 30 December 2014; Accepted: 5 April 2015; Published: 2016
First available in Project Euclid: 22 November 2017

zbMATH: 1333.05255
MathSciNet: MR3470735
Digital Object Identifier: 10.2140/involve.2016.9.333

Primary: 05C75
Secondary: 05C25 , 05C78

Keywords: closed graph , Clustering coefficient

Rights: Copyright © 2016 Mathematical Sciences Publishers

Vol.9 • No. 2 • 2016
Back to Top