4   Artículos

 
en línea
Alexandra O. Shabarkova,Mikhail B. Abrosimov     Pág. 28 - 32
One of the most important types of graphs are tournaments, as they find practical application in many areas of our lives. Recall that a tournament is a complete oriented graph, that is, a directed graph, between each pair of its vertices there is a singl... ver más
Revista: International Journal of Open Information Technologies    Formato: Electrónico

 
en línea
Mikhail B. Abrosimov,Peter V. Razumovsky     Pág. 1 - 7
The article describes the results of the search for a minimal vertex and edge extensions of an undirected colored star graphs. This search is a part of the minimal extensions of a colored graphs problem research. A graph G* is called a vertex (edge) k-ex... ver más
Revista: International Journal of Open Information Technologies    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »