CFP last date
16 December 2024
Call for Paper
January Edition
IJAIS solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 16 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

Strong Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs

by M. Manjuri, B. Maheswari
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 7 - Number 4
Year of Publication: 2014
Authors: M. Manjuri, B. Maheswari
10.5120/ijais14-451185

M. Manjuri, B. Maheswari . Strong Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs. International Journal of Applied Information Systems. 7, 4 ( June 2014), 15-21. DOI=10.5120/ijais14-451185

@article{ 10.5120/ijais14-451185,
author = { M. Manjuri, B. Maheswari },
title = { Strong Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs },
journal = { International Journal of Applied Information Systems },
issue_date = { June 2014 },
volume = { 7 },
number = { 4 },
month = { June },
year = { 2014 },
issn = { 2249-0868 },
pages = { 15-21 },
numpages = {9},
url = { https://www.ijais.org/archives/volume7/number4/636-1185/ },
doi = { 10.5120/ijais14-451185 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T18:54:57.612594+05:30
%A M. Manjuri
%A B. Maheswari
%T Strong Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 7
%N 4
%P 15-21
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Today, graph theory is one of the most flourishing branches of modern mathematics with wide applications to combinatorial problems and to classical algebraic problems. Graph theory has applications in diverse areas such as social sciences, linguistics, physical sciences, communication engineering etc. Because of this diversity in applications it is useful to develop and study this subject in abstract terms of the objects of any particular system in which one may be interested. Product of graphs are introduced in Graph Theory very recently and developing rapidly. In this paper, we consider direct product graphs of Cayley graphs with Arithmetic graphs and discuss strong domination parameter of these graphs.

References
  1. Madhavi, L. - Studies on domination parameters and enumeration of cycles in some Arithmetic graphs, Ph. D. Thesis submitted to S. V. University, Tirupati, India (2002).
  2. Manjuri, M. and Maheswari, B. - Strong dominating sets of Euler totient Cayley graph and Arithmetic Vn graphs, International Journal of Computer Applications (IJCA), Volume 83, No3 (2013), 36-40.
  3. Nathanson and B. Melvyn, -Connected components of arithmetic graphs, Monat. fur. Math, 29, (1980), 219 – 220.
  4. Sampathkumar, E. and Pushpa Latha, L. -, Strong weak domination and domination balance in graph, Discrete Mathematics, 161 (1996), 235-242.
  5. Uma Maheswari, S. - Some studies on the product graphs of Euler totient Cayley graphs and Arithmetic Vn graphs, Ph. D. Thesis submitted to S. P. Women's University, Tirupati, India (2012).
  6. Whitehead, A. N. , Russel, B. - Principia Mathematica, Volume 2, Cambridge University Press, Cambridge (1912).
Index Terms

Computer Science
Information Sciences

Keywords

Euler totient Cayley graph Arithmetic V_n graph direct product graph Strong dominating set.

Powered by PhDFocusTM