On closed graphs, II

Cox, David A.; Erskine, Andrew

doi:10.2140/involve.2016.9.333

Download this article
	For screen
	For printing

Recent Issues

The Journal

About the journal

Ethics and policies

Peer-review process

Submission guidelines

ISSN 1944-4184 (online)

ISSN 1944-4176 (print)

Author index

To appear

Other MSP journals

On closed graphs, II

David A. Cox and Andrew Erskine

Vol. 9 (2016), No. 2, 333–345

DOI: 10.2140/involve.2016.9.333

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.

Keywords

closed graph, clustering coefficient

Mathematical Subject Classification 2010

Primary: 05C75

Secondary: 05C25, 05C78

Milestones

Received: 30 December 2014

Accepted: 5 April 2015

Published: 2 March 2016

Communicated by Colin Adams

Authors

David A. Cox
Department of Mathematics and Statistics Amherst College Amherst, MA 01002-5000 United States

Andrew Erskine
Department of Mathematics and Statistics Amherst College Amherst, MA 01002-5000 United States

Vol. 9, No. 2, 2016