DOMINATION NUMBER AND IDENTIFYING CODE NUMBER OF THE SUBDIVISION GRAPHS
Let $G=(V, E)$ be a simple graph. A set $C$ of vertices of $G$ is an identifying code of $G$ if for every two vertices $x$ and $y$ the sets $N_{G}[x] \cap C$ and $N_{G}[y] \cap C$ are non-empty and different. Given a graph $G,$ the smallest size of an identifying code of $G$ is called the ide...
में बचाया:
| मुख्य लेखकों: | , , |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
Shahrood University of Technology
2025-07-01
|
| श्रृंखला: | Journal of Algebraic Systems |
| विषय: | |
| ऑनलाइन पहुंच: | https://jas.shahroodut.ac.ir/article_3099_119cec81cde678f908b0392e4b1ccb85.pdf |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|