Abstract
A setS of lines is a line dominating set if every line not inS is adjacent to some line ofS. The line domination number of a graph is the cardinality of a minimum line dominating set. In this paper we study the line dominating sets and obtain bounds for the line domination number. Also, Nordhaus-Gaddum type results are obtained for the line domination number and the line domatic number.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chartrand, G., Schuster, S.: On the independence numbers of complementary graphs. Transactions of the New York Academy of Sciences, Series II.36 (3), 247–51 (1974)
Cockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. Networks7, 247–261 (1977)
Gupta, R.P.: Independence and covering numbers of line graphs and total graphs. In: Proof Techniques in Graph Theory, edited by F. Harary. New York: Academic Press 1969
Harary, F.: Graph Theory. Reading: Addison-Wesley 1969
Mitchell, S., Hedetniemi, S.T.: Edge domination in trees. In: Proc. Eigth S.E. Conf. on Comb. Graph Theory and Computing. Los Angeles: Baton Rouge 1977
Neeralagi, P.S.: Ph.D. Thesis
Sampathkumar, E., Walikar, H.W.: Unpublished work
Walikar, H.W., Acharya, B.D., Sampathkumar, E.: Recent developments in the theory of domination in graphs. In: MRI Lecture Notes in Mathematics. Allahabad: the Mehta Research Institute of Mathematics and Mathematical Physics 1979
Zelinka, B.: Edge-domatic number of a graph. Czech. Math. J.33, 108 (1983)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jayaram, S.R. Line domination in graphs. Graphs and Combinatorics 3, 357–363 (1987). https://doi.org/10.1007/BF01788558
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788558