Total Domination Multisubdivision Number of a Graph
The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msdγt (G) of a gr...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
University of Zielona Góra
2015-05-01
|
| Colección: | Discussiones Mathematicae Graph Theory |
| Materias: | |
| Acceso en línea: | https://doi.org/10.7151/dmgt.1798 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|