We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Upper Domatic Number of Certain Graphs.
- Authors
Annamma, V.; H., Akthar Jahan
- Abstract
Let G(v, E) be a graph with vertex set v(G) and edge set E(G). The maximum order of the partitions of the vertex set represented by {v1, v2, ..., vk }, is called upper domatic number where each class of partition dominates one another (i.e.) vi dominates vj or vj dominates vi or both (i ≠ j). Upper domatic number is denoted by D(G). In this paper we determine the upper domatic number of certain graphs such as double fan graph DFn, friendship graph Fn and helm graph Hn.
- Subjects
GRAPH theory; PARTITIONS (Mathematics); SET theory; GEOMETRIC vertices; SUBSET selection
- Publication
Journal of Algebraic Statistics, 2022, Vol 13, Issue 2, p3234
- ISSN
1309-3452
- Publication type
Article