ContactsAddress: Markusa st. 22, Vladikavkaz,
|
DOI: 10.23671/VNC.2013.2.10526 CN-edge domination in graphs
Abstract:
Let \(G=(V,E)\) be a graph. A subset \(D\) of \(V\) is called common neighbourhood dominating set (CN-dominating set) if for every \(v\in V-D\) there exists a vertex \(u\in D\) such that \(uv\in E(G\)$ and \(|\Gamma(u,v)|\geq1\), where \(|\Gamma(u,v)|\) is the number of common neighbourhood between the vertices\(u\) and \(v\). The minimum cardinality of such CN-dominating set denoted by \(\gamma_{cn}(G)\) and is called common neighbourhood domination number (CN-edge domination).
Keywords: common neighbourhood edge dominating set, common neighbourhood edge domatic number, common neighbourhood edge domination number
Language: English
Download the full text
For citation: Alwardi A., Soner N.D. CN-edge domination in graphs // Vladikavkazskii matematicheskii zhurnal [Vladikavkaz Math. J.], vol. 15, no. 2, pp.12-18.
DOI 10.23671/VNC.2013.2.10526 ← Contents of issue |
|
|
|||
© 1999-2021 Þæíûé ìàòåìàòè÷åñêèé èíñòèòóò | |||