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...
Sábháilte in:
| Príomhchruthaitheoirí: | , , |
|---|---|
| Formáid: | Academic Paper |
| Foilsithe / Cruthaithe: |
Discrete Mathematics, Algorithms and Applications, Vol. 11, No. 6 (2019) 1950071,
2020-06-25T04:50:17Z.
|
| Ábhair: | |
| Rochtain ar líne: | Get Fulltext |
| Clibeanna: |
Cuir clib leis
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|
Ar líne
Get Fulltext3rd Floor Main Library
| Gairmuimhir: |
A1234.567 |
|---|---|
| Cóip 1 | Ar fáil |