International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 83 - Issue 3 |
Published: December 2013 |
Authors: M. Manjuri, B. Maheswari |
![]() |
M. Manjuri, B. Maheswari . Strong Dominating Sets of Some Arithmetic Graphs. International Journal of Computer Applications. 83, 3 (December 2013), 36-40. DOI=10.5120/14431-2577
@article{ 10.5120/14431-2577, author = { M. Manjuri,B. Maheswari }, title = { Strong Dominating Sets of Some Arithmetic Graphs }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 83 }, number = { 3 }, pages = { 36-40 }, doi = { 10.5120/14431-2577 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A M. Manjuri %A B. Maheswari %T Strong Dominating Sets of Some Arithmetic Graphs%T %J International Journal of Computer Applications %V 83 %N 3 %P 36-40 %R 10.5120/14431-2577 %I Foundation of Computer Science (FCS), NY, USA
Graph Theory has been realized as one of the most flourishing branches of modern Mathematics finding widest applications in all most all branches of Sciences, Social Sciences, Engineering, Computer Science, etc. Number Theory is one of the oldest branches of Mathematics, which inherited rich contributions from almost all greatest mathematicians, ancient and modern. Using the number theoretic function Euler totient function an Euler totient Cayley graph is defined and in this paper we study the Strong domination parameters of Euler totient Cayley graphs and Arithmetic Vn Graphs.