On the bondage, strong and weak bondage numbers in Complementary Prism Graphs
Let $G =(V(G),E(G))$ be a simple undirected graph of order $n$, and let $S \subseteq V(G)$. If every vertex in $V(G)-S$ is adjacent to at least one vertex in $S$, then the set $S$ is called a \textit{dominating set}. The \textit{domination number} of $G$ is the minimum cardinality taken over all...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2021-04-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v29-n1/v29-n1-(pp59-75).pdf |