Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
APA
Cox, D. A., & Erskine, A. (2016). On closed graphs, II. Involve, 9(2), 333–345. https://doi.org/10.2140/involve.2016.9.333
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free