About
6
Publications
61
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
2
Citations
Publications
Publications (6)
In this paper, career guidance and gamification tools are identified that contribute to the activation of cognitive activity, allow diversifying the types of educational activities and increase interest in the materials of a career guidance course in mathematics. As the subject content of building a career guidance course, the course "Theory of Pro...
Prime divisors of orders of automorphisms and the fixed point subgraphs of automorphisms of prime orders are studied for a hypothetical distance-regular graph with intersection array (45, 42, 1; 1, 6, 45). It is proved that this graph does not vertex-symmetric.
Consider a connected edge regular graph Γ with parameters (v, k, λ) and put b
1 = k−λ−1. A triple (u, w, z) of vertices is called (almost) good whenever d(u, w) = d(u, z) = 2 and µ(u, w)+µ(u, z) ≤ 2k − 4b
1 + 3 (and µ(u, w) + µ(u, z) = 2k − 4b
1 + 4). If k = 3b
1 + γ with γ ≥ −2, a triple (u, w, z) is almost good, and Δ = [u] ∩ [w] ∩ [z] then: eith...
