Encontrados 2 documentos, a visualizar página 1 de 1
One size resolvability of graphs
Kwancharone, S.; Saenpholphat, V.; Fonseca, C. M. daFor an ordered set W = w1,w2, · · · ,wk of vertices in a connected graph G and a vertex v of G, the code of v with respect to W is the k-vector CW(v) = (d(v,w1), d(v,w2), · · · , d(v,wk)). The set W is a one size resolving set for G if (1) the size of subgraph hWi induced by W is one and (2) distinct vertices of G have distinct code with respect to W. The minimum cardinality of a one size resolving set in graph...
The cardinality of endomorphisms of some oriented paths: an algorithm
Arworn, Sr.; Fonseca, C. M. da; Saenpholphat, V.An endomorphism of a (oriented) graph is a mapping on the vertex set preserving (arcs) edges. In this paper we provide an algorithm to determine the cardinalities of endomorphism monoids of some ( nite) directed paths, based on results on simple paths. ; Chiang Mai University; CMUC - Centro de Matemática da Universidade de Coimbra; Srinakharinwirot University; Thailand Research Fund and Commission on Higher ...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||