Title

An Extremal Problem For Edge Domination Insensitive Graphs

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Discret Appl. Math.

Keywords

Mathematics; Applied

Abstract

A connected graph is edge domination insensitive if the domination number is unchanged when any single edge is removed. The minimum number of edges required by such a graph is determined. Similar results are given when the graph must remain connected upon any edge's removal and when the dominating set must remain fixed.

Journal Title

Discrete Applied Mathematics

Volume

20

Issue/Number

2

Publication Date

1-1-1988

Document Type

Article

Language

English

First Page

113

Last Page

125

WOS Identifier

WOS:A1988N808300003

ISSN

0166-218X

Share

COinS