International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 134 - Issue 5 |
Published: January 2016 |
Authors: Mohammed Alatif, Puttaswamy Rangaiah, Nayaka S.R. |
![]() |
Mohammed Alatif, Puttaswamy Rangaiah, Nayaka S.R. . Boundary Domination of Line and Middle Graph of Wheel Graph Families. International Journal of Computer Applications. 134, 5 (January 2016), 1-5. DOI=10.5120/ijca2016907928
@article{ 10.5120/ijca2016907928, author = { Mohammed Alatif,Puttaswamy Rangaiah,Nayaka S.R. }, title = { Boundary Domination of Line and Middle Graph of Wheel Graph Families }, journal = { International Journal of Computer Applications }, year = { 2016 }, volume = { 134 }, number = { 5 }, pages = { 1-5 }, doi = { 10.5120/ijca2016907928 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2016 %A Mohammed Alatif %A Puttaswamy Rangaiah %A Nayaka S.R. %T Boundary Domination of Line and Middle Graph of Wheel Graph Families%T %J International Journal of Computer Applications %V 134 %N 5 %P 1-5 %R 10.5120/ijca2016907928 %I Foundation of Computer Science (FCS), NY, USA
Let G = (V;E) be a connected graph. A subset S of V (G) is called a boundary dominating set if every vertex of V − S is boundary dominated by some vertex of S. The minimum taken over all boundary dominating sets of a graph G is called the boundary domination number of G and is denoted by γb(G). We define the boundary domatic number in graphs. Exact values of of Wheel Graph Families are obtained and some other interesting results are established.