The following pages link to I. A. Mednykh (Q339985):
Displaying 41 items.
- On the structure of the Jacobian group for circulant graphs (Q339986) (← links)
- On the Farkas and Accola theorems for graphs (Q352214) (← links)
- The equivalence classes of holomorphic mappings of genus 3 Riemann surfaces onto genus 2 Riemann surfaces (Q515495) (← links)
- Classification up to equivalence of the holomorphic mappings of Riemann surfaces of low genus (Q542193) (← links)
- Asymptotics and arithmetical properties of complexity for circulant graphs (Q721814) (← links)
- Counting rooted spanning forests in cobordism of two circulant graphs (Q779138) (← links)
- (Q890852) (redirect page) (← links)
- On the structure of Picard group for Moebius ladder (Q890854) (← links)
- Counting spanning trees in cobordism of two circulant graphs (Q1615746) (← links)
- Viktor Vasil'evich Chueshev is 70 (Q1685405) (← links)
- On the sharp upper bound for the number of holomorphic mappings of Riemann surfaces of low genus (Q1760501) (← links)
- On holomorphic maps between Riemann surfaces of genera three and two (Q1760928) (← links)
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic (Q1999743) (← links)
- Complexity of the circulant foliation over a graph (Q2025146) (← links)
- Kirchhoff index for circulant graphs and its asymptotics (Q2243794) (← links)
- Plans' periodicity theorem for Jacobian of circulant graphs (Q2243871) (← links)
- On automorphisms of graphs and Riemann surfaces acting with fixed points (Q2285000) (← links)
- On the Oikawa and Arakawa theorems for graphs (Q2317370) (← links)
- Complexity of discrete Seifert foliations over a graph (Q2332088) (← links)
- Discrete analogs of Farkas and Accola's theorems on hyperelliptic coverings of a Riemann surface of genus 2 (Q2342340) (← links)
- On Wiman's theorem for graphs (Q2346344) (← links)
- A generalization of Hurwitz' theorem for groups acting on a graph (Q2353070) (← links)
- On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials (Q2361566) (← links)
- Vladislav Vasil'evich Aseev is 70 (Q2403685) (← links)
- Counting rooted spanning forests for circulant foliation over a graph (Q2679743) (← links)
- On \(\gamma\)-hyperellipticity of graphs (Q2810392) (← links)
- Isospectral genus two graphs are isomorphic (Q2827776) (← links)
- On irregular holomorphic mappings of a Riemann surface of genus four onto a Riemann surface of genus two (Q2885301) (← links)
- On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials (Q4629559) (← links)
- Two Moore’s Theorems for Graphs (Q4963480) (← links)
- On the Jacobian Group for Möbius Ladder and Prism Graphs (Q4982823) (← links)
- The number of rooted forests in circulant graphs (Q5037930) (← links)
- Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics (Q5056827) (← links)
- On the structure of the critical group of a circulant graph with non-constant jumps (Q5112453) (← links)
- On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs (Q5217374) (← links)
- On the Jacobian group of a cone over a circulant graph (Q6117337) (← links)
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians (Q6184481) (← links)
- On the structure of Laplacian characteristic polynomial of circulant graphs (Q6545162) (← links)
- The Kirchhoff indices for circulant graphs (Q6641635) (← links)
- On Jacobian group and complexity of the \(Y\)-graph (Q6642670) (← links)
- One can hear a discrete rectangular torus (Q6755393) (← links)
