CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Strong Dominating Sets of Some Arithmetic Graphs

by M. Manjuri, B. Maheswari
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 83 - Number 3
Year of Publication: 2013
Authors: M. Manjuri, B. Maheswari
10.5120/14431-2577

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 },
issue_date = { December 2013 },
volume = { 83 },
number = { 3 },
month = { December },
year = { 2013 },
issn = { 0975-8887 },
pages = { 36-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume83/number3/14431-2577/ },
doi = { 10.5120/14431-2577 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:58:26.793364+05:30
%A M. Manjuri
%A B. Maheswari
%T Strong Dominating Sets of Some Arithmetic Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 83
%N 3
%P 36-40
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Nathanson and B. Melvyn, -Connected components of arithmetic graphs, Monat. fur. Math, 29, (1980), 219 – 220.
  2. L. Madhavi, Studies on domination parameters and enumeration of cycles in some Arithmetic Graphs,Ph. D. Thesis submitted to S. V. University, Tirupati, India, (2002).
  3. S. Uma Maheswari, and B. Maheswari, – Domination parameters of Euler Totient Cayley Graphs, Rev. Bull. CalMath. Soc. , 19 (2), (2011), 207-214.
  4. S. Uma Maheswari, and B. Maheswari, – Some Domination parameters of Arithmetic Graph Vn, IOSR,Journal of Mathematics, Volume 2, Issue 6, (Sep Oct 2012), 14 -18.
  5. E. Sampathkumar, L. Pushpa Latha – Strong weak domination and domination balance in graph, Discrete Mathematics, 161(1996), 235-242.
Index Terms

Computer Science
Information Sciences

Keywords

Euler totient Cayley graphs Arithmetic Vn Graphs Strong domination Cayley Graph

Powered by PhDFocusTM