An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences

DOI10.20429/TAG.2018.050202zbMATH Open1416.05073arXiv1803.00673OpenAlexW2962787338WikidataQ129130847 ScholiaQ129130847MaRDI QIDQ5225547

Author name not available (Why is that?)

Publication date: 22 July 2019

Published in: (Search for Journal in Brave)

Abstract: We present an algorithm to test whether a given graphical degree sequence is forcibly connected or not and prove its correctness. We also outline the extensions of the algorithm to test whether a given graphical degree sequence is forcibly $k$-connected or not for every fixed $kge2$. We show through experimental evaluations that the algorithm is efficient on average, though its worst case run time is probably exponential. We also adapt Ruskey et al's classic algorithm to enumerate zero-free graphical degree sequences of length $n$ and Barnes and Savage's classic algorithm to enumerate graphical partitions of even integer $n$ by incorporating our testing algorithm into theirs and then obtain some enumerative results about forcibly connected graphical degree sequences of given length $n$ and forcibly connected graphical partitions of given even integer $n$. Based on these enumerative results we make some conjectures such as: when $n$ is large, (1) almost all zero-free graphical degree sequences of length $n$ are forcibly connected; (2) almost none of the graphical partitions of even $n$ are forcibly connected.

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

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225547)