Search Results - "Makhnev, A"

On -Polynomial Shilla Graphs with by Makhnev, A. A., Van, Zh

“…A Shilla graph is a distance-regular graph of diameter 3 and second eigenvalue . In case divides  put . Furthermore, and  has the intersection array . Belousov…”
Get full text

Automorphisms of a Distance Regular Graph with Intersection Array by Makhnev, A. A.

“…A. A. Makhnev and M. S. Nirova found the intersection arrays of distance regular graphs with and at most 4096 vertices. For graphs of diameter , of most…”
Get full text

On Automorphisms of a Graph with Intersection Array $ \{44,30,9;1,5,36\} by Isakova, M. M., Makhnev, A. A., Chen, M.

“…Given a set of the automorphisms of a graph , let be the set of all vertices of fixed by each automorphism in . There are exactly 7 admissible intersection…”
Get full text

On Graphs in Which the Neighborhoods of Vertices Are Edge-Regular Graphs without 3-Claws by Chen, M., Makhnev, A. A., Nirova, M. S.

“…The triangle-free Krein graph Kre 𝑟 is strongly regular with parameters . The existence of such graphs is known only for 𝑟 1 (the complement of the Clebsch…”
Get full text

The graph Kre(4) does not exist by Makhnev, A. A.

“…Suppose that a strongly regular graph Γ with parameters ( v , k , λ, μ) has eigenvalues k , r , and s . If the graphs Γ and Γ ¯ are connected, then the…”
Get full text

On Distance-Regular Graphs of Diameter With Eigenvalue by Makhnev, A. A., Belousov, I. N.

“…For a distance-regular graph of diameter , the graph can be strongly regular only if either or . For the case in which is strongly regular, Koolen and his…”
Get full text

Inverse Problems in the Class of Distance-Regular Graphs of Diameter 4 by Makhnev, A. A., Paduchikh, D. V.

“…For a distance-regular graph  Γ of diameter  4 , the graph Δ subscript Γ 1 2 can be strongly regular. In this case, the graph subscript Γ 3 4 is strongly…”
Get full text

The Koolen–Park Boundary and Distance-Regular Graphs without m-Claws by Makhnev, A. A., Guo, Wenbin, Efimov, K. S.

“…J.H. Koolen and J. Park found a boundary for the maximum size of the coclique in the neighborhood of a vertex of a distance-regular graph. Using this boundary,…”
Get full text

Use of a New Structure of Fluorescent-Labeled DNA Oligonucleotides to Reveal Mutation JAK2 V617F During Development of Leukemia by Makhnev, A. A., Baimirzaev, A. B., Nasriddinov, Kh. Z., Alimukhamedova, O. B., Azimova, Sh. S.

Get full text

Automorphisms of a Graph With Intersection Array {nm − 1, nm− n + m − 1, n − m + 1;1, 1, nm− n + m − 1} by Makhnev, A. A., Golubyatnikov, M. P.

“…Automorphisms of a graph with intersection array {nm − 1, nm− n + m − 1, n − m + 1; 1, 1, nm− n + m − 1} are considered…”
Get full text

On the Nonexistence of Distance-Regular Graphs with Intersection Array by Makhnev, A. A., Golubyatnikov, M. P.

“…We consider -polynomial graphs of diameter . Alongside the infinite series of intersection arrays , the following admissible intersection arrays of -polynomial…”
Get full text

Distance-Regular Graphs of Diameter 3 Without Triangles with c2=2 by Makhnev, A. A., Guo, Wenbin, Efimov, K. S.

“…Earlier it was proved that some distance-regular graphs of diameter 3 with c 2 = 2 do not exist. Distance-regular graph Γ with intersection array { 17 , 16 ,…”
Get full text

Optical Properties of Linear-Chain Carbon Film Deposited on a Steel Sample by Akashev, L. A., Makhnev, A. A., Kochakov, V. D., Vladimirov, A. P., Druzhinin, A. V.

“…The optical constants of a linear chain carbon (LCC) film in the spectral range from 248 to 1100 nm (1.13–5.0 eV with a step of 0.1 eV) were obtained by the…”
Get full text

Time Resolution and Light Yield of Scintillation Detector Samples for the Time-of-Flight Neutron Detector of the BM@N Experiment by Guber, F. F., Ivashkin, A. P., Karpushkin, N. M., Makhnev, A. I., Morozov, S. V., Serebryakov, D. V.

“…— A new compact time-of-flight neutron detector is being planned for the identification and energy measurement of neutrons produced in nucleus-nucleus…”
Get full text

The Largest Moore Graph and a Distance-Regular Graph with Intersection Array {55, 54, 2; 1, 1, 54} by Makhnev, A. A., Paduchikh, D. V.

“…We point out possible automorphisms of a distance-regular graph Γ with intersection array {55, 54, 2; 1, 1, 54} and spectrum 55 1 , 7 1617 ,−1 110 ,−8 1408 …”
Get full text

Inverse Problems in the Theory of Distance-Regular Graphs: Dual 2-Designs by Belousov, I. N., Makhnev, A. A.

“…Let  Γ be a distance-regular graph of diameter 3 with a strongly regular graph  subscript Γ 3 . Finding the parameters of  subscript Γ 3 from the intersection…”
Get full text

On extensions of some block designs by Makhnev, A. A.

“…There are some results concerning t -designs in which the number of points in the intersection of two blocks takes less than t values. For example, if t = 2,…”
Get full text

Antipodal Krein Graphs and Distance-Regular Graphs Close to Them by Makhnev, A. A.

“…An antipodal nonbipartite distance-regular graph Γ of diameter 3 has an intersection array ( ) and eigenvalues k , n , –1, and – m , where n and – m are the…”
Get full text

Electronic Structure and Optical Properties of Heusler Alloy Mn1.5Fe1.5Al by Shreder, E. I., Lukoyanov, A. V., Makhnev, A. A., Kuzmin, Yu. I., Dash, Shubhra, Patra, Ajit K., Vasundhara, M.

“…Theoretical calculations of the electronic structure and measurements of optical properties of the Heusler alloy Mn 1.5 Fe 1.5 Al have been performed. The…”
Get full text

A Shilla graph with Intersection Array {12, 10, 2; 1, 2, 8} Does not Exist by Makhnev, A. A., Golubyatnikov, M. P.

Get full text