Maximal resolving sets in a graph
Let G be a connected graph. A subset [Formula: see text] of [Formula: see text] is called a resolving set of G if the code of any vertex [Formula: see text] with respect to S is different from the code of any other vertex where code of u with respect to S denoted by [Formula: see text] is defined as...
| मुख्य लेखकों: | , |
|---|---|
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
World Scientific Publishing
2024-12-01
|
| श्रृंखला: | International Journal of Mathematics for Industry |
| विषय: | |
| ऑनलाइन पहुंच: | https://www.worldscientific.com/doi/10.1142/S2661335224500059 |