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

Matching Dominating Sets of Interval Graphs

by K. Dhanalakshmi, B. Maheswari
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 88 - Number 5
Year of Publication: 2014
Authors: K. Dhanalakshmi, B. Maheswari
10.5120/15347-3688

K. Dhanalakshmi, B. Maheswari . Matching Dominating Sets of Interval Graphs. International Journal of Computer Applications. 88, 5 ( February 2014), 9-11. DOI=10.5120/15347-3688

@article{ 10.5120/15347-3688,
author = { K. Dhanalakshmi, B. Maheswari },
title = { Matching Dominating Sets of Interval Graphs },
journal = { International Journal of Computer Applications },
issue_date = { February 2014 },
volume = { 88 },
number = { 5 },
month = { February },
year = { 2014 },
issn = { 0975-8887 },
pages = { 9-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume88/number5/15347-3688/ },
doi = { 10.5120/15347-3688 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:06:48.849713+05:30
%A K. Dhanalakshmi
%A B. Maheswari
%T Matching Dominating Sets of Interval Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 88
%N 5
%P 9-11
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Interval graphs have drawn the attention of many researchers for over 30 years. They are extensively been studied and revealed their practical relevance for modeling problems arising in the real world. The theory of domination in graphs is an enriching area of research at present. In this paper we discuss matching domination number of interval graphs and propose an algorithm for finding matching dominating sets in interval graphs.

References
  1. O. Ore, - Theory of Graphs, Amer. Math. Soc. Colloq. Publ. 38, Providence (1962).
  2. C. Berge, - Graphs and hypergraphs, North-Holland, Amsterdam(1973).
  3. E. J. Cockayne, and S. T. Hedetniemi, -Towards a theory of domination in graphs, Networks 7,(1977), 247-261.
  4. K. Dhana Lakshmi and B. Maheswari, - Inverse dominating set of Interval graphs – Journal of Current Sciences- Vol. 15 no. 1 (2010 ),189-192.
  5. K. Dhana Lakshmi and B. Maheswari, -Minimum Global neighbourhood set of Interval graphs – Journal of Pure and Applied Physics Vol. 20,no. 3 (2008), 183-187.
Index Terms

Computer Science
Information Sciences

Keywords

Interval graph dominating set matching dominating set and neighbourhood set

Powered by PhDFocusTM