Skip navigation
Skip navigation

Counting loopy graphs with given degrees

Greenhill, Catherine; McKay, Brendan


Let d=(d1,d2,⋯,dn) be a vector of nonnegative integers. We study the number of symmetric 0-1 matrices whose row sum vector equals d. While previous work has focussed on the case of zero diagonal, we allow diagonal entries to equal 1. Specifically, for D

CollectionsANU Research Publications
Date published: 2012
Type: Journal article
Source: Linear Algebra and its Applications
DOI: 10.1016/j.laa.2011.03.052


File Description SizeFormat Image
01_Greenhill_Counting_loopy_graphs_with_2012.pdf411.25 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  22 January 2019/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator