On closed graphs II
classification
🧮 math.CO
keywords
closedgraphsarticleaspectsbinomialcertainclusteringcoefficients
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.