6 Art�culos

Methods for finding minimal primitive extensions of directed graphs

Acceso

en l�nea

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

Revista: International Journal of Open Information Technologies Formato: Electr�nico

Tabla de contenido: Vol: 9 Num: 6 Par: 0 A�o: 2021

Construction of minimum vertex extensions of a graph by the Read-Faradzhev method

Acceso

en l�nea

I.A.K. Kamil,M.B. Abrosimov,A.A. Lobov P�g. 54 - 58

In 1976 John Hayes proposed a graph-based model to investigate node fault tolerance of discrete systems. A graph G* is vertex k-extension of a graph G if after removing any k vertices from G* result graph contains G. A vertex k-extension of the graph G i... ver m�s

Revista: International Journal of Open Information Technologies Formato: Electr�nico

Tabla de contenido: Vol: 8 Num: 4 Par: 0 A�o: 2020

« Anterior P�gina: 1 de 1 Siguiente »