The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs

ABSTRACT Let μ(G)$$ \mu (G) $$ denote the minimum number of edges whose addition to G$$ G $$ results in a Hamiltonian graph, and let μ^(G)$$ \hat{\mu}(G) $$ denote the minimum number of edges whose addition to G$$ G $$ results in a pancyclic graph. We study the distributions of μ(G),μ^(G)$$ \mu (G),...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 66; no. 2
Main Authors:	Alon, Yahav, Anastos, Michael
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.03.2025 Wiley Subscription Services, Inc
Subjects:	Algorithms Apexes Graph theory Graphs Hamilton cycles Lower bounds pancyclic graphs Polynomials random graph process random graphs
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!