Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Frasser, Carlos E."'
Autor:
Frasser, Carlos E.
The following is an exposition of a course of algebra that Prof. Aleksandr Aleksandrovich Zykov (1922-2013) distributed among the participants of his seminar in graph theory not far away from Odessa, Ukraine, on September, 1991. It is a privilege for
Externí odkaz:
http://arxiv.org/abs/2411.11873
Autor:
Frasser, Carlos E.
Publikováno v:
German International Journal of Modern Science 86 (2024) pp. 15-17
In 1955, Greenwood and Gleason showed that the Ramsey number R(3, 3, 3) = 17 by constructing an edge-chromatic graph on 16 vertices in three colors with no triangles. Their technique employed finite fields. This same result was obtained later by usin
Externí odkaz:
http://arxiv.org/abs/2408.00815
Autor:
Frasser, Carlos E.
Publikováno v:
German International Journal of Modern Science 61 (2023) pp. 40-44
Graph theory and enumerative combinatorics are two branches of mathematical sciences that have developed astonishingly over the past one hundred years. It is especially important to point out that graph theory employs combinatorial techniques to solv
Externí odkaz:
http://arxiv.org/abs/2307.10133
Autor:
Frasser, Carlos E.
Publikováno v:
German International Journal of Modern Science 36 (2022) pp. 7-9
This note describes some open problems that can be examined with the purpose of gaining additional insight of how to solve the problem of finding a general classification of geodetic graphs
Comment: 6 pages
Comment: 6 pages
Externí odkaz:
http://arxiv.org/abs/2202.10663
Autor:
Frasser, Carlos E., Vostrov, George N.
This paper describes a new approach to the problem of the structural research of clusters based on the theory of geodetic and k-geodetic graphs. We firmly believe that this same approach can be used when solving problems of correlation between struct
Externí odkaz:
http://arxiv.org/abs/1705.10036
Autor:
Frasser, Carlos E.
Publikováno v:
German International Journal of Modern Science 85 (2024) pp. 29-36
A fundamental characteristic of computer networks is their topological structure. The question of the description of the structural characteristics of computer networks represents a problem that is not completely solved. Search methods for structures
Externí odkaz:
http://arxiv.org/abs/1701.00302
Autor:
Frasser, Carlos E., Vostrov, George N.
Publikováno v:
International Journal of Graph Theory and its Applications 3(1) (2020) pp. 13-44
This paper describes a new approach to the problem of generating the class of all geodetic graphs homeomorphic to a given geodetic one. An algorithmic procedure is elaborated to carry out a systematic finding of such a class of graphs. As a result, t
Externí odkaz:
http://arxiv.org/abs/1611.01873