|
|
|
|
|
A.A. Ripinen,M.B. Abrosimov
Pág. 46 - 50
A graph G is called primitive if all vertices in it are mutually reachable in the same number of steps. The concept of primitivity was originally formulated for matrices and naturally extended to graphs when considering a graph as an adjacency matrix. Re...
ver más
|
|
|
|
|