Minimum dominating set of P4 x Cm, M_>3
In computer science and mathematics, we use diagrams in order to solve problems. Let G= (V, E) be an undirected graph, where V is the set of vertices in G and E is the set of edges in G. A dominating set S of a graph G is a subset of the set of vertices V such every vertex in V is adjacent to at lea...
| Autor Principal: | |
|---|---|
| Formato: | Thesis |
| Idioma: | English |
| Publicado: |
2010
|
| Subjects: |