• INVERSE LINE DOMINATION IN GRAPHS
Abstract
Let be the line graph of and let be a line dominating set in , if contains another dominating set , then is called an inverse line dominating set with respect to . The minimum cardinality of vertices in such a set is called an inverse line domination number in and is denoted by. In this paper, we study the graph theoretic properties of and many bounds were obtained in terms of elements of and its relationships with other domination parameters were found.
Keywords
Full Text:
pdfThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |