Study of Graph Partitions Approach satisfies Vizing's Conjecture
For a graph G(V,E) , a subset of vertices D is a dominating set if for each vertex 12x∈"> V either 12x∈D"> , or x is adjacent to at least one vertex of D . The domination number , 12خ³G, "> is the order of smallest dominating set of G . In [7], Vizing conjectured t...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
Tishreen University
2019-02-01
|
| Series: | مجلة جامعة تشرين للبحوث والدراسات العلمية، سلسلة العلوم الأساسية |
| Online Access: | http://journal.tishreen.edu.sy/index.php/bassnc/article/view/3780 |