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
Reseach Article

Unidominating Functions of Corona Product Graph

by B. Aruna, B. Maheswari
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 177 - Number 15
Year of Publication: 2019
Authors: B. Aruna, B. Maheswari
10.5120/ijca2019919578

B. Aruna, B. Maheswari . Unidominating Functions of Corona Product Graph. International Journal of Computer Applications. 177, 15 ( Nov 2019), 44-47. DOI=10.5120/ijca2019919578

@article{ 10.5120/ijca2019919578,
author = { B. Aruna, B. Maheswari },
title = { Unidominating Functions of Corona Product Graph },
journal = { International Journal of Computer Applications },
issue_date = { Nov 2019 },
volume = { 177 },
number = { 15 },
month = { Nov },
year = { 2019 },
issn = { 0975-8887 },
pages = { 44-47 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume177/number15/30978-2019919578/ },
doi = { 10.5120/ijca2019919578 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:46:00.826882+05:30
%A B. Aruna
%A B. Maheswari
%T Unidominating Functions of Corona Product Graph
%J International Journal of Computer Applications
%@ 0975-8887
%V 177
%N 15
%P 44-47
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Graph Theory is the developing area of research and it is one of the important branch of Mathematics. The theory of domination in graphs introduced by Ore [7] and Berge [2] is a fascinating area of research in graph theory and it has witnessed a spectacular growth in the last three decades. Corona product graph is a new concept introduced by Frucht and Harary [3] and it is receiving much attention of the researchers. A new product on two graphs

References
  1. Anantha Lakshmi, V. A Study on Unidominating and Total Unidominating functions of Some Standard
  2. Graphs, Ph.D. thesis, Sri Padmavati Mahila Visvavidyalayam, Tirupati, Andhra Pradesh, India, (2015).
  3. Berge, C. The Theory of Graphs and its Applications, Methuen, London (1962).
  4. Frucht, R. Harary, F On the corona of Two Graphs. AequationesMathematicae, 1970,
  5. Volume 4, Issue 3, pp. 322-325
  6. Hedetniemi S .M, Hedetniemi, S.T. and Wimer, T. V. - Linear time resource allocation algorithms for trees. Technical report URI – 014, Department of Mathematics, Clemson University, 1987.
  7. T.W. Haynes, T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
  8. T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.
  9. Ore, O. Theory of Graphs, Amer. Soc. Colloq. Publ. Vol.38. Amer. Math. Soc., Providence, RI, (1962).
Index Terms

Computer Science
Information Sciences

Keywords

Unidominating function unidomination number minimal unidominating function upper unidomination number.