Counting loopy graphs with given degrees

Date

Authors

Greenhill, Catherine

McKay, Brendan

Publisher

Elsevier

Abstract

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

Keywords

Keywords: Asymptotic enumeration; Binomial distribution; Graph; Loop; matrix; Random graphs; Random Matrix; Integer programming; Matrix algebra; Poisson distribution; Trace analysis; Trace elements; Graph theory Asymptotic enumeration; Graph; Loop; Poisson binomial distribution; Random graph; Random matrix; Symmetric 0-1 matrix

URI

http://hdl.handle.net/1885/17041

Collections

ANU Research Publications

Source

Linear Algebra and its Applications

Type

Journal article

DOI

10.1016/j.laa.2011.03.052

Restricted until

2037-12-31

Downloads

File

Description

01_Greenhill_Counting_loopy_graphs_with_2012.pdf (411.25 KB)