Armando Gordon Cabral, Federico Severino Guimpel (col.)
Es sabido que las potencias sucesivas de las matrices de incidencia en un grafo dirigido asignando valores 1 o 0 según exista(n) o no arco(s) entre los vértices correspondientes con el producto usual, indican la existencia o no de caminos o circuítos. Y que la suma usual determina la cantidad de caminos y circuitos.
En el presente trabajo se construye un semianillo o dioide a partir del conjunto de arcos, que permite establecer cuantos y cuales son los caminos y circuitos de un grafo dirigido donde ningún arco es recorrido k o más veces.
It is known that the successive powers of the incidence matrix in a directed graph, by assorting 1 or 0 values wther or not there exist arcs between the corresponding vertices with the usual product, show the existence or non-existence of paths and circuits. And they also show that the usual summa determines the amount of paths and circuits.
In the present paper, a semi-ring or dioid starting from the set of arcs is constructed, which allows the setting of how many and which the paths and circuits of a directed graph are, where no arc is k-run or run more times.
in the present paper, a semi-ring or dioid starting from the set of arcs is constructed, which allows the setting of how many and which the
© 2001-2024 Fundación Dialnet · Todos los derechos reservados