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

Complementary Perfect Domination Number of Regular Graphs

by Vipin Kumar, Ankit Verma, Shashank Bharadwaj
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 4 - Number 2
Year of Publication: 2012
Authors: Vipin Kumar, Ankit Verma, Shashank Bharadwaj
10.5120/ijais12-450615

Vipin Kumar, Ankit Verma, Shashank Bharadwaj . Complementary Perfect Domination Number of Regular Graphs. International Journal of Applied Information Systems. 4, 2 ( September 2012), 12-16. DOI=10.5120/ijais12-450615

@article{ 10.5120/ijais12-450615,
author = { Vipin Kumar, Ankit Verma, Shashank Bharadwaj },
title = { Complementary Perfect Domination Number of Regular Graphs },
journal = { International Journal of Applied Information Systems },
issue_date = { September 2012 },
volume = { 4 },
number = { 2 },
month = { September },
year = { 2012 },
issn = { 2249-0868 },
pages = { 12-16 },
numpages = {9},
url = { https://www.ijais.org/archives/volume4/number2/271-0615/ },
doi = { 10.5120/ijais12-450615 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T10:46:56.170179+05:30
%A Vipin Kumar
%A Ankit Verma
%A Shashank Bharadwaj
%T Complementary Perfect Domination Number of Regular Graphs
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 4
%N 2
%P 12-16
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper authors describe domination number of regular graphs as well as complimentary perfect domination number and induced complimentary perfect domination number, denoted by cpd and iced. Let G(v,e) be a graph with 'n' vertices and 'e' edges then these are denoted by . and . In this paper we describe, How to calculate . and of regular graphs. Authors characterize 2 regular graphs with and 3 regular graphs with and describe an upper limit for number of vertices in d-regular graph. In the end of the paper we characterize all the d-regular graphs with and practical utilization of cpd and ipcd.

References
  1. Arumugam S, "Total Domination graph " Arts Combing – 43 (2008) P. P / 89-92
  2. Paulraj Joseph, J and Arumugam S "Domination and connectivity in graphs. IJOMAS V-3 (1992) P. P 233-236
  3. Paulraj Joseph, J and Arumugam S "On graph with equal domination and connected domination number. " Disc Math's 206 (1999)(45-49)
  4. Sampat Kumar, E Walikar, "The connected Domination number of a graph J. Math Physics science-13 (1979) No-6 P. P 607-613
  5. Teresa W, Hayes and Peter J. Slater Fundamentals of domination in Graph Journal of G. T. 07 1998
  6. Balakrishan R and Reganathan K, A textbook of Graph Theory, Springer Verlog, New York.
  7. Haynes, Teresa W, "Induced – Paired Domination n Graphs" Arts Combing 57 P. P (111-128)
  8. Salter, P. J "Domination and Reference set in a graph, J. Math Physicd Science" 22 (1998) P. P (455-465)
  9. W, maccuaig and B shepherd," Domination in graph with minimum degree two" Journal of graph Theory 13 (1989) (749-762).
  10. P,Manual,I Raja Singh J Quadras "Embedding of hypercube in to complete binary tree" ICICS,Iternational Conference, Saudi Arabia. (2000).
  11. Paulraj J Joseph and Mehadevan,"Induced and -paired domination chromatic number of a graph" Journal of Discrete Mathematics & Cryptology. (Reprint)
Index Terms

Computer Science
Information Sciences

Keywords

Domination number representation of two graphs with one cpd and ipcd of regular graph d-regular

Powered by PhDFocusTM