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

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

by M. Manjuri, B. Maheswari
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 174 - Number 21
Year of Publication: 2021
Authors: M. Manjuri, B. Maheswari
10.5120/ijca2021921114

M. Manjuri, B. Maheswari . Clique Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs. International Journal of Computer Applications. 174, 21 ( Feb 2021), 43-49. DOI=10.5120/ijca2021921114

@article{ 10.5120/ijca2021921114,
author = { M. Manjuri, B. Maheswari },
title = { Clique Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs },
journal = { International Journal of Computer Applications },
issue_date = { Feb 2021 },
volume = { 174 },
number = { 21 },
month = { Feb },
year = { 2021 },
issn = { 0975-8887 },
pages = { 43-49 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume174/number21/31800-2021921114/ },
doi = { 10.5120/ijca2021921114 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:22:45.605823+05:30
%A M. Manjuri
%A B. Maheswari
%T Clique Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 174
%N 21
%P 43-49
%D 2021
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The basic ideas of graph theory are introduced in the 18th century by the great mathematician Leonard Euler. Since then relatively in a short period, major developments of graph theory has occurred and inspired to a larger degree and it has become the source of interest to many researchers. To some extent this may be due to the ever growing importance of computer science and its connection with graph theory. 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 Clique domination parameter of these graphs.

References
  1. Ore, O.1962. Theory of Graphs, Amer. Math. Soc. Colloq. Publ., 38, Providence.
  2. Berge, C. 1962. The Theory of Graphs and its Applications. Methuen. London.
  3. Whitehead, A.N., Russel, B. 1912. Principia Mathematica, Volume 2, Cambridge University Press, Cambridge.
  4. Madhavi, L. 2002. Studies on domination parameters and enumeration of cycles in some Arithmetic graphs, Ph. D. Thesis submitted to S.V.University, Tirupati, India.
  5. Manjuri, M. 2014. Some studies on dominating parameters of product graphs of euler totient cayley graphs and arithmetic Vn graphs, Ph.D. Thesis submitted to Sri Padmavathi Mahila Visvavidyalayam, Tirupati, India.
  6. Vasumathi, N. 1994. Number theoretic graphs, Ph. D. Thesis submitted to S.V.University, Tirupati, India.
  7. Uma Maheswari, S. 2012. Some studies on the product graphs of Euler totient Cayley graphs and Arithmetic Vn graphs, Ph.D. Thesis submitted to Sri Padmavathi Mahila Visvavidyalayam, Tirupati, India.
Index Terms

Computer Science
Information Sciences

Keywords

Euler totient Cayley graph Arithmetic graph direct product graph Clique dominating set. Subject Classification: 68R10

Powered by PhDFocusTM