Line domination in graphs
type: Item
instance of: scholarly article
title: Line domination in graphs
zbMATH Open document ID: 0628.05056
DOI: 10.1007/BF01788558
author: S. R. Jayaram
published in: Graphs and Combinatorics
publication date: 1987-01-01T00:00:00Z
review text: 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.
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 4021196
zbMATH Keywords: edge-edge domination
zbMATH Keywords: line domination number
MaRDI profile type: Publication
cites work: Q5183522
cites work: Towards a theory of domination in graphs
cites work: Q5588430
cites work: Q5572939
cites work: Q3870917
cites work: Q3895508
cites work: Edge-domatic number of a graph
description: scientific article; zbMATH DE number 4021196