A Class of Graphs Approaching Vizing's Conjecture
For any graph <em>G=(V,E)</em>, a subset <em>S</em> of <em>V</em> <em>dominates</em> <em>G</em> if all vertices are contained in the closed neighborhood of <em>S</em>, that is <em>N[S]=V</em>. The minimum cardinality...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2016-01-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol3/iss1/4 |