On closed graphs. II

DOI10.2140/INVOLVE.2016.9.333zbMATH Open1333.05255arXiv1501.00165OpenAlexW2197310370MaRDI 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
• On \(m\)-closed graphs
• A note on closed graph theorems
• On some regularities of graphs. II.
• scientific article
• Publication:3476853
• scientific article; zbMATH DE number 3910419

zbMATH Keywords

closed graphclustering coefficient

Mathematics Subject Classification ID

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 (1)

• Two‐arc closed subsets of graphs

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)