ISSN 16833414 (Print) • ISSN 18140807 (Online)  
Log in 
ContactsAddress: Vatutina st. 53, Vladikavkaz,

DOI: 10.23671/VNC.2013.2.10526 CNedge domination in graphs
Abstract:
Let \(G=(V,E)\) be a graph. A subset \(D\) of \(V\) is called common neighbourhood dominating set (CNdominating set) if for every \(v\in VD\) 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 CNdominating set denoted by \(\gamma_{cn}(G)\) and is called common neighbourhood domination number (CNedge 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. CNedge domination in graphs // Vladikavkazskii matematicheskii zhurnal [Vladikavkaz Math. J.], vol. 15, no. 2, pp.1218.
DOI 10.23671/VNC.2013.2.10526 ← Contents of issue 
 

© 19992023 Þæíûé ìàòåìàòè÷åñêèé èíñòèòóò  