Involve: A Journal of Mathematics
- Volume 9, Number 2 (2016), 333-345.
On closed graphs, II
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.
Involve, Volume 9, Number 2 (2016), 333-345.
Received: 30 December 2014
Accepted: 5 April 2015
First available in Project Euclid: 22 November 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 05C75: Structural characterization of families of graphs
Secondary: 05C25: Graphs and abstract algebra (groups, rings, fields, etc.) [See also 20F65] 05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Cox, David A.; Erskine, Andrew. On closed graphs, II. Involve 9 (2016), no. 2, 333--345. doi:10.2140/involve.2016.9.333. https://projecteuclid.org/euclid.involve/1511371004