Zobrazeno 1 - 6
of 6
pro vyhledávání: '"V. I. Benediktovich"'
Autor:
V. M. Demidenko, V. I. Benediktovich
Publikováno v:
Informatika, Vol 19, Iss 1, Pp 72-87 (2022)
O b j e c t i v e s. The problem of efficient organization of the execution of sequential computational processes in the vector mode is solved, taking into account the capabilities of modern high-performance vector-pipeline computers. The relevance o
Externí odkaz:
https://doaj.org/article/a152d5aaac11444eba2d977cd60c9a16
Autor:
V. I. Benediktovich
Publikováno v:
Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series. 59:62-70
In recent years, the eigenvalues of the distance matrix of a graph have attracted a lot of attention of mathematicians, since there is a close connection between its spectrum and the structural properties of the graph. Thus, quite recently an interes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54ad61b61c4444cb82dd8de8afa2fc79
https://doi.org/10.29235/1561-2430-2023-59-1-62-70
https://doi.org/10.29235/1561-2430-2023-59-1-62-70
Autor:
V. I. Benediktovich
Publikováno v:
Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series. 58:169-178
It is known that the existence of many classical combinatorial structures in a graph, such as perfect matchings, Hamiltonian cycles, effective dominating sets, etc., can be characterized using (κ,τ)-regular sets, whose determination is equivalent t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::942a9a939fbb4f2373f857b1696636f6
https://doi.org/10.29235/1561-2430-2022-58-2-169-178
https://doi.org/10.29235/1561-2430-2022-58-2-169-178
Autor:
V. I. Benediktovich
Publikováno v:
Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series. 57:274-285
It is well known that the recognition problem of the existence of a perfect matching in a graph, as well as the recognition problem of its Hamiltonicity and traceability, is NP-complete. Quite recently, lower bounds for the size and the spectral radi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d45507f1283476c8586105bca37d1d34
https://doi.org/10.29235/1561-2430-2021-57-3-274-285
https://doi.org/10.29235/1561-2430-2021-57-3-274-285
Autor:
V. I. Benediktovich
Publikováno v:
Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series. 55:169-175
A graph parameter – a circumference of a graph – and its relationship with the algebraic parameters of a graph – eigenvalues of the adjacency matrix and the unsigned Laplace matrix of a graph – are considered in this article. Earlier we have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::533dbdb69378681821f0b622f42bd081
https://doi.org/10.29235/1561-2430-2019-55-2-169-175
https://doi.org/10.29235/1561-2430-2019-55-2-169-175
Autor:
V. I. Benediktovich
Publikováno v:
Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series. 54:434-440
An algebraic parameter of a graph – a difference between its maximum degree and its spectral radius is considered in this paper. It is well known that this graph parameter is always nonnegative and represents some measure of deviation of a graph fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9ccae8af47266f2f1b2d630c1c91186
https://doi.org/10.29235/1561-2430-2018-54-4-434-440
https://doi.org/10.29235/1561-2430-2018-54-4-434-440