On the double bondage number of graphs products
A set $D$ of vertices of graph $G$ is called $double$ $dominating$ $set$ if for any vertex $v$, $|N[v]\cap D|\geq 2$. The minimum cardinality of $double$ $domination$ of $G$ is denoted by $\gamma_d(G)$. The minimum number of edges $E'$ such that $\gamma_d(G\setminus E)>\gamma_d(G)$ is called the dou...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
University of Isfahan
2019-03-01
|
| Schriftenreihe: | Transactions on Combinatorics |
| Schlagworte: | |
| Online-Zugang: | https://toc.ui.ac.ir/article_23167_c10b003a8aa01309879f4e72bf73d795.pdf |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|