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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Non-split and Inverse Non-split Domination Numbers in the Join and Corona of Graphs

by Esamel M. Paluga, Rolando N. Paluga
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 60 - Number 2
Year of Publication: 2012
Authors: Esamel M. Paluga, Rolando N. Paluga
10.5120/9661-4082

Esamel M. Paluga, Rolando N. Paluga . Non-split and Inverse Non-split Domination Numbers in the Join and Corona of Graphs. International Journal of Computer Applications. 60, 2 ( December 2012), 1-5. DOI=10.5120/9661-4082

@article{ 10.5120/9661-4082,
author = { Esamel M. Paluga, Rolando N. Paluga },
title = { Non-split and Inverse Non-split Domination Numbers in the Join and Corona of Graphs },
journal = { International Journal of Computer Applications },
issue_date = { December 2012 },
volume = { 60 },
number = { 2 },
month = { December },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume60/number2/9661-4082/ },
doi = { 10.5120/9661-4082 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:07:51.081082+05:30
%A Esamel M. Paluga
%A Rolando N. Paluga
%T Non-split and Inverse Non-split Domination Numbers in the Join and Corona of Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 60
%N 2
%P 1-5
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A dominating set D of a graph G = (V;E) is non-split dominating set if hV n Di is connected. The non-split domination number of G is the minimum cardinality of a non-split dominating set inG. LetD be a minimum dominating set inG. If a subset D 0 of V n D is dominating in G, then D 0 is called an inverse dominating set with respect to D. Furthermore, if V n D 0 is connected, then D 0 is called an inverse non-split dominating set. The inverse non-split domination number of G is the minimum cardinality of an inverse non-split dominating set in G. In this paper, characterization of non-split dominating sets in the join and corona of two graphs are presented. Furthermore, explicit formulas for determining the non-split and inverse nonsplit domination numbers of these graphs are also determined.

References
  1. B. Balasundaram, S. Butenko. Graph domination, coloring and cliques in telecommunications. Handbook of Optimization in Telecommunications, pages 865-890. Springer, 2006.
  2. K. Ameenal Bibi. , K. Selvakumar. The inverse split and nonsplit domination in graphs. International Journal of Computer Applications, (0975 -8887), No. 7, Vol 8, 2010.
  3. G. J. Chang. Algorithm Aspects of Domination in Graphs.
  4. C. E. Go, S. R. Canoy, Jr. Domination in the corona and join of graphs. International Mathematical Forum, Vol. 6, 2011, no. 16, 763 - 771.
  5. F. Harary, Graph Theory. Addison-Wesley, Reading MA (1969).
  6. V. R. Kulli, B. Janakiram. The split domination number of a graph. Graph Theory Notes of New York. New York Academy of Sciences. XXXII, pp. 16-19.
  7. V. R. Kulli, B. Janakiram. The non-split domination number of a graph. The Journal of Pure and Applied Math, 31(5), pp. 545-550, 2000.
  8. O. Ore. Theory of graphs. American Mathematical Society Colloquium Publications, Vol XXXVIII, American Mathematical Society, Providence, R. I. 1962.
Index Terms

Computer Science
Information Sciences

Keywords

non-split domination inverse non-split domination join coronaifx

Powered by PhDFocusTM