Author(s):
1. Libin Chacko Samuel:
Department of Mathematics, CHRIST (Deemed to be University),Bangalore, Karnataka,India
2. Mayamma Joseph:
Department of Mathematics, CHRIST (Deemed to be University),Bangalore, Karnataka,India
Abstract:
A partition = fV1; V2; : : : ; Vkg of the vertex set V (G) of a graph G = (V; E) is an upper domatic partition if Vi dominates Vj or Vj dominates Vi or both for all Vi; Vj 2 . The maximum order of an upper domatic partition of G is called the upper domatic number D(G) of G. In this article, we determine the upper domatic number of 4-regular graphs. We also find the upper domatic number of 5-regular graphs with girth at least five and determine the upper domatic number of the complements of cycles.
Page(s):
16-21
Published:
Journal: Discrete Mathematics Letters, Volume: 8, Issue: 0, Year: 2022
Keywords:
domatic number
,
rregular graphs
,
upper domatic number
References:
References are not available for this document.
Citations
Citations are not available for this document.