|
Characterization of Graphs with Maximum Degree and Tree Dom Strong Domination Number
|
|
| Author:
|
M. MEERAL, S. GAYATHRI DEVI, P. MUNIAPPAN
|
| Abstract:
|
In graph theory, domination is the major area which attracts researchers due to its potential to solve many real life problems. Particularly, tree dom strong domination solves problems involving design and analysis of communication network and social network. For every v? V – DS where DS is a Dom strong dominating set (Dsd-set), there exists u_(1,) u_2?DS such that u_1 v, u_2 v?E(G) and deg(u_(1 ))=deg(v). The minimum cardinality of a Dsd-set is denoted by ?_dsd (G). A Dsd-set of a graph G is a tree dom strong dominating set (trdsd set) if the induced subgraph is a tree. The minimum cardinality taken over all tree dom strong dominating sets is denoted by ?_trdsd(G). The sum of the tree dom strong domination number and maximum degree of graphs equal to 2n-3 is studied and characterized the corresponding extremal graphs.
|
| Keyword:
|
Dom Strong Domination Number, Tree Dom Strong Domination Number, Maximum Degree.
|
| EOI:
|
-
|
| DOI:
|
https://doi.org/10.31838/ijpr/2020.12.03.114
|
| Download:
|
Request For Article
|
|
|