Contents

Ars Combinatoria

  • Research article

On the Tree Domination Number of a Random Graph

Lane Clark 1, Darin Johnson2
1DEPARTMENT OF MATHEMATICS, SOUTHERN ILLINOIS UNIVERSITY CAR- BONDALE, CARBONDALE, IL 62901-4408
2DEPARTMENT OF MATHEMATICAL SCIENCES, DELAWARE STATE UNI- VERSITY, Dover, DE 19901
  • Published: 31/01/2015

Abstract

We prove a two-point concentration for the tree domination number of the random graph \(G_{n,p}\) provided \(p\) is constant or \(p \to 0\) sufficiently slow.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Lane Clark , Darin Johnson. On the Tree Domination Number of a Random Graph[J], Ars Combinatoria, Volume 118. 227-241. .