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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
World Scientific Publishing
2024-12-01
|
| Series: | International Journal of Mathematics for Industry |
| Subjects: | |
| Online Access: | https://www.worldscientific.com/doi/10.1142/S2661335224500059 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|