The nonsplit domination in subdivision graph
Abstract A dominating set D of a graph G = (V, E) is a nonsplit dominating set if the induced subgraph 〈V − D〉 is connected. The nonsplit domination number γ ns (G) of G is the minimum cardinality of a nonsplit dominating set. An edge e = uv of a graph G is sa...
Saved in:
| Main Authors: | , |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2020
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000501113 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|