On closed graphs. II

DOI10.2140/INVOLVE.2016.9.333MaRDI QIDQ258679zbMATH OpenOpenAlexFDO

Authors David A. Cox, Andrew Erskine

Publication date 10 March 2016

Published in Involve (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.00165

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)

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.

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

Cited in

(3)

• On \(m\)-closed graphs
• Two‐arc closed subsets of graphs
• On closed graphs. I

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)