Resolving Domination Number of Graphs
For a set W = { s1,s2,...,sk of vertices of a graph G, the representation multiset of a vertexv of G with respect to W is r(v | W ) = { d(v, s1),d(v, s2),...,d(v, sk) } , where d(v, si) is a distance between of the vertex v and the vertices in W together with their multiplicities. The set W is a res...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Academic Paper |
| Published: |
Discrete Mathematics, Algorithms and Applications, Vol. 11, No. 6 (2019) 1950071,
2020-06-25T04:50:17Z.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |