CFP last date
20 December 2024
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 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Total Unidominating Functions of a Path

by V. Anantha Lakshmi, B. Maheswari
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 126 - Number 13
Year of Publication: 2015
Authors: V. Anantha Lakshmi, B. Maheswari
10.5120/ijca2015906250

V. Anantha Lakshmi, B. Maheswari . Total Unidominating Functions of a Path. International Journal of Computer Applications. 126, 13 ( September 2015), 43-48. DOI=10.5120/ijca2015906250

@article{ 10.5120/ijca2015906250,
author = { V. Anantha Lakshmi, B. Maheswari },
title = { Total Unidominating Functions of a Path },
journal = { International Journal of Computer Applications },
issue_date = { September 2015 },
volume = { 126 },
number = { 13 },
month = { September },
year = { 2015 },
issn = { 0975-8887 },
pages = { 43-48 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume126/number13/22616-2015906250/ },
doi = { 10.5120/ijca2015906250 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:17:24.982771+05:30
%A V. Anantha Lakshmi
%A B. Maheswari
%T Total Unidominating Functions of a Path
%J International Journal of Computer Applications
%@ 0975-8887
%V 126
%N 13
%P 43-48
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Domination in graphs is an emerging area of research at present and it has applications to several fields such as School bus routing, Computer communication networks, Facility location problems, Locating radar stations problem etc. Recently dominating functions in domination theory have received much attention. The new concepts viz., unidominating functions and total unidominating functions have been introduced. In this paper some total unidominating functions of a path are presented and determined its total unidomination number. Also the number of total unidominating functions with minimum weight is investigated.

References
  1. Allan, R.B. and Laskar, R.C. (1978), On domination, independent domination numbers of a graph, Discrete Math., 23, 73-76.
  2. Anantha Lakshmi, V and Maheswari, B. –Unidominating functions of a Path, IJCET, volume 6(2015), 11-19.
  3. Cockayne, E.J. and Hedetniemi, S.T. (1977), Towards a theory of domination in graphs, Networks, 7, 247-261.
  4. Cockayne, C.J., Dawes, R.M., and Hedetniemi, S.T., Total domination in graphs, Networks, 10 (1980), 211 – 219.
  5. Cockayne, E.J., Mynhardt, C.M. and Yu, B. Total dominating functions in trees: Minimality and Convexity, Journal of Graph Theory, 19(1995), 83 – 92.
  6. Haynes, T.W. Hedetniemi, S.T. Slater, P.J. Fundamentals of domination in graphs, Marcel Dekker, Inc., New York (1998).
  7. Haynes, T. W., Hedetniemi, S.T., Slater, P.J., Domination in graphs: Advanced Topics, Marcel Dekker, Inc., New York (1998).
Index Terms

Computer Science
Information Sciences

Keywords

Path Total unidominating function Total unidomination number.

Powered by PhDFocusTM