International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 88 - Issue 5 |
Published: February 2014 |
Authors: K. Dhanalakshmi, B. Maheswari |
![]() |
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 }, year = { 2014 }, volume = { 88 }, number = { 5 }, pages = { 9-11 }, doi = { 10.5120/15347-3688 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2014 %A K. Dhanalakshmi %A B. Maheswari %T Matching Dominating Sets of Interval Graphs%T %J International Journal of Computer Applications %V 88 %N 5 %P 9-11 %R 10.5120/15347-3688 %I Foundation of Computer Science (FCS), NY, USA
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.