Line domination in graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1987 English Publisher:Springer Science and Business Media LLCJournal:Graphs and Combinatorics, volume 3, pages 357-363 (issn: 0911-0119, eissn: 1435-5914,

Copyright policy )

Authors: S. R. Jayaram;

doi: 10.1007/bf01788558

Line domination in graphs

- Summary
- Subjects
- Metrics

Abstract

The line domination number of a graph is the minimum number of edges with the property that every other edge is adjacent to some of these edges. Several results, especially bounds, on this number are presented.

Keywords

Graph theory, edge-edge domination, line domination number

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	12
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average