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

Submit your paper
Know more
The week's pick
Responsive image
A Lightweight Proof of Stake Voting Mechanism with Byzantine Agreement and Cryptographic Sortition for Telemedicine Systems

Denis Wapukha Walumbe Gabriel Ndung’u Kamau Jane Wanjiru Njuki
Random Articles
Reseach Article

On Vn-Arithmetic Graph

by R. Ranjarajan, Akram Alqesmah, Anwar Alwardi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 125 - Number 9
Year of Publication: 2015
Authors: R. Ranjarajan, Akram Alqesmah, Anwar Alwardi
10.5120/ijca2015905563

R. Ranjarajan, Akram Alqesmah, Anwar Alwardi . On Vn-Arithmetic Graph. International Journal of Computer Applications. 125, 9 ( September 2015), 1-7. DOI=10.5120/ijca2015905563

@article{ 10.5120/ijca2015905563,
author = { R. Ranjarajan, Akram Alqesmah, Anwar Alwardi },
title = { On Vn-Arithmetic Graph },
journal = { International Journal of Computer Applications },
issue_date = { September 2015 },
volume = { 125 },
number = { 9 },
month = { September },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-7 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume125/number9/22457-2015905563/ },
doi = { 10.5120/ijca2015905563 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:16:12.127386+05:30
%A R. Ranjarajan
%A Akram Alqesmah
%A Anwar Alwardi
%T On Vn-Arithmetic Graph
%J International Journal of Computer Applications
%@ 0975-8887
%V 125
%N 9
%P 1-7
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Vn-Arithmetic graph has been introduced by Vasumathi and Vangipuram [9]. In this paper some properties of Vn-Arithmetic graph, maximum degree, minimum degree, number of edges, diameter, radius, Hamiltonian and Eulerian are studied. Also, we introduce m-Arithmetical graphs. Some properties and interesting results for m-Arithmetical graphs are established.

References
  1. F. Harary, Graph theory, Addison-Wesley, Reading Mass (1969).
  2. M.Manjuri and B.Maheswari, Strong Dominating Sets of Some Arithmetic Graphs. International Journal of Computer Applications 83(3):36-40, December 2013.
  3. M.Manjuri and B.Maheswari, Some Domination Parameters of Arithmetic Vn Graph. International Journal of Computer Applications 92(11):29-32, April 2014.
  4. M.Manjuri and B Maheswari, Strong Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs. International Journal of Applied Information Systems 7(4):15- 21, June 2014.
  5. Nathanson, Melvyn B. Connected Components of Arithmetic Graphs. Monatshefte fr Mathematik. 1980, Vol. 89, Issue 3, pp. 219-222.
  6. 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.
  7. S.Uma Maheswari, B.Maheswari and M.Manjuri, Some Domination Parameters of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs. International Journal of Computer Applications 58(9):32-38, November 2012.
  8. S.Uma Maheswari, B.Maheswari and M.Manjuri, Matching Dominating Sets of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs. International Journal of Computer Applications 60(11):11-16, December 2012.
  9. N.Vasumath. Number theoretic graphs. Ph.D. Thesis, S.V.University, Tirupati, India 1994.
Index Terms

Computer Science
Information Sciences

Keywords

Vn-Arithmetic graph m-Arithmetic graph

Powered by PhDFocusTM