Abstract
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. Keywordsgraph, dominating set, matching dominating set and neighbourhood set
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
