Author:
Wieland Ben,Godbole Anant P.
Abstract
In this paper, we show that the domination number $D$ of a random graph enjoys as sharp a concentration as does its chromatic number $\chi$. We first prove this fact for the sequence of graphs $\{G(n,p_n\},\; n\to\infty$, where a two point concentration is obtained with high probability for $p_n=p$ (fixed) or for a sequence $p_n$ that approaches zero sufficiently slowly. We then consider the infinite graph $G({\bf Z}^+, p)$, where $p$ is fixed, and prove a three point concentration for the domination number with probability one. The main results are proved using the second moment method together with the Borel Cantelli lemma.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Robust domination in random graphs;Indian Journal of Pure and Applied Mathematics;2023-01-24
2. Connected domination in random graphs;Indian Journal of Pure and Applied Mathematics;2022-06-02
3. Graphs with Diameter 2 and Large Total Domination Number;Graphs and Combinatorics;2020-11-02
4. Nordhaus–Gaddum problems for power domination;Discrete Applied Mathematics;2018-12
5. Estimation of the domination number in sparse random graphs and applications;Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems;2017-08-31