Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph
A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs $G$ for which the Cartesian product $G \Box H$ is an efficient open domination graph when $H$ is a complete graph of order at least 3 or...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Discrete Mathematics & Theoretical Computer Science
2016-06-01
|
| Col·lecció: | Discrete Mathematics & Theoretical Computer Science |
| Matèries: | |
| Accés en línia: | https://dmtcs.episciences.org/1277/pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|