publication . Preprint . 2016

Edge Cut Domination, Irredundance, and Independence in Graphs

Fenstermacher, Todd; Hedetniemi, Stephen; Laskar, Renu;
Open Access English
  • Published: 05 May 2016
Abstract
An edge dominating set $F$ of a graph $G=(V,E)$ is an \textit{edge cut dominating set} if the subgraph $\langle V,G-F \rangle$ is disconnected. The \textit{edge cut domination number} $\gamma_{ct}(G)$ of $G$ is the minimum cardinality of an edge cut dominating set of $G.$ In this paper we study the edge cut domination number and investigate its relationships with other parameters of graphs. We also introduce the properties edge cut irredundance and edge cut independence.
Subjects
free text keywords: Mathematics - Combinatorics, 05C69
Download from

[1] Cockayne, E. J., and S. T. Hedetniemi. “Independence graphs.” in: Proceedings 5th S.E. Conference on Combinatorics, Graph Theory and Computing. Utilitas Math. (1974): 471-491.

[2] Cockayne, E. J., and S. T. Hedetniemi. “Towards a theory of domination in graphs.” Networks 7.3 (1977): 247-261. [OpenAIRE]

[3] Kulli, V. R., and B. Janakiram. “The split domination number of a graph.” Graph Theory Notes of New York, New York Academy of Sciences (1997): XXXII, 16-19.

[4] Neeralagi, P. S., and G.K. Nayak. “The split edge domination and split edge neighbourhood numbers of a graph.” Graph Theory and Its Applications (2004): 112-115.

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue