Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Alexander Mednykh"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AJ,..., Iss Proceedings (2008)
In this paper we solve the known V.A. Liskovets problem (1996) on the enumeration of orientable coverings over a non-orientable manifold with an arbitrary finitely generated fundamental group. As an application we obtain general formulas for the numb
Externí odkaz:
https://doaj.org/article/00c56160a79c41b18372486e4961df18
Autor:
Alexander Mednykh
Publikováno v:
Contemporary Mathematics. :301-309
The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first homology group. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b2151179a8dc4b969ef6a0346a775e1
https://doi.org/10.1090/conm/776/15618
https://doi.org/10.1090/conm/776/15618
Autor:
I. A. Mednykh, Alexander Mednykh
Publikováno v:
Doklady Mathematics. 103:139-142
Plans’ theorem states that, for odd n, the first homology group of the n-fold cyclic covering of the three-dimensional sphere branched over a knot is the direct product of two copies of an Abelian group. A similar statement holds for even n. In thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53b4a137a66e1cde61ad2621d0f8282a
https://doi.org/10.1134/s1064562421030121
https://doi.org/10.1134/s1064562421030121
Autor:
Alexander Mednykh, I. A. Mednykh
Publikováno v:
Doklady Mathematics. 102:392-395
The aim of this paper is to find an analytical formula for the Kirchhoff index of circulant graphs $${{C}_{n}}({{s}_{1}},{{s}_{2}},\; \ldots ,\;{{s}_{k}})$$ and $${{C}_{{2n}}}({{s}_{1}},{{s}_{2}},\; \ldots ,\;{{s}_{k}},n)$$ with even and odd valency,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5760303bdc0f5990376d29605da36f7
https://doi.org/10.1134/s106456242005035x
https://doi.org/10.1134/s106456242005035x
Autor:
G. Chelnokov, Alexander Mednykh
Publikováno v:
Communications in Algebra. 48:2725-2739
There are only 10 Euclidean forms, that is flat closed three-dimensional manifolds: six are orientable and four are non-orientable. The aim of this paper is to describe all types of n-fold covering...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a42542d29de127f2fda8a5fc45de0191
https://doi.org/10.1080/00927872.2019.1705468
https://doi.org/10.1080/00927872.2019.1705468
Autor:
Alexander Mednykh, I. A. Mednykh
Publikováno v:
Algebra Colloquium. 27:87-94
Let [Formula: see text] be the generating function for the number [Formula: see text] of spanning trees in the circulant graph Cn(s1, s2, …, sk). We show that F(x) is a rational function with integer coefficients satisfying the property F(x) = F(1/
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4495fd0ad060f20f2b67eae73d34fdd7
https://doi.org/10.1142/s1005386720000085
https://doi.org/10.1142/s1005386720000085
Publikováno v:
Journal of Algebraic Combinatorics. 53:115-129
In the present paper, we investigate the complexity of infinite family of graphs $H_n=H_n(G_1,\,G_2,\ldots,G_m)$ obtained as a circulant foliation over a graph $H$ on $m$ vertices with fibers $G_{1},\,G_{2},\ldots,G_{m}.$ Each fiber $G_{i}=C_{n}(s_{i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3b32e57a6d6bd933b8bb4195b116363
https://doi.org/10.1007/s10801-019-00921-7
https://doi.org/10.1007/s10801-019-00921-7
Autor:
Nikolay Abrosimov, Alexander Mednykh
Publikováno v:
Topology and Geometry
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::440dc886e8d13fc192c05fa9498c7424
https://doi.org/10.4171/irma/33-1/20
https://doi.org/10.4171/irma/33-1/20
Autor:
Alexander Mednykh, I. A. Mednykh
Publikováno v:
Russian Mathematical Surveys. 75:190-192
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c103f27989c8301f1d2408967d68c2a3
https://doi.org/10.1070/rm9904
https://doi.org/10.1070/rm9904
Publikováno v:
Doklady Mathematics. 99:286-289
We study the complexity of an infinite family of graphs $${{H}_{n}} = {{H}_{n}}({{G}_{1}},{{G}_{2}}, \ldots ,{{G}_{m}})$$ that are discrete Seifert foliations over a given graph H on m vertices with fibers $${{G}_{1}},{{G}_{2}}, \ldots ,{{G}_{m}}.$$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35bba6659bb45a20f50eeb420a5d8282
https://doi.org/10.1134/s1064562419030141
https://doi.org/10.1134/s1064562419030141