The edge domination problem

Gerard J. Chang, Shiow-Fen Hwang

Discussiones Mathematicae Graph Theory · 1995 · 20 citations · 3 references

Concepts

Abstract

An edge dominating set of a graph is a set D of edges such that every edge not in D is adjacent to at least one edge in D: In this paper we present a linear time algorithm for flnding a minimum edge dominating set of a block graph.

References

3