On closed graphs. II
From MaRDI portal
Publication:258679
DOI10.2140/INVOLVE.2016.9.333zbMATH Open1333.05255OpenAlexW2197310370MaRDI QIDQ258679FDOQ258679
Authors: David A. Cox, Andrew Erskine 
Publication date: 10 March 2016
Published in: Involve (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1501.00165
Recommendations
- On closed graphs. I
- On graph closures
- On the closed graph theorem
- scientific article; zbMATH DE number 4152420
- On \(m\)-closed graphs
- A note on closed graph theorems
- On some regularities of graphs. II.
- scientific article; zbMATH DE number 169341
- Publication:3476853
- scientific article; zbMATH DE number 3910419
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (3)
This page was built for publication: On closed graphs. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q258679)
