Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Alexander A. Makhnev"'
Publikováno v:
Ural Mathematical Journal, Vol 10, Iss 1 (2024)
We consider antipodal graphs \(\Gamma\) of diameter 4 for which \(\Gamma_{1,2}\) is a strongly regular graph. A.A. Makhnev and D.V. Paduchikh noticed that, in this case, \(\Delta=\Gamma_{3,4}\) is a strongly regular graph without triangles. It is kno
Externí odkaz:
https://doaj.org/article/8533ac44829140be88425108879be416
Publikováno v:
Ural Mathematical Journal, Vol 8, Iss 2 (2022)
For a distance-regular graph \(\Gamma\) of diameter 3, the graph \(\Gamma_i\) can be strongly regular for \(i=2\) or 3. J.Kulen and co-authors found the parameters of a strongly regular graph \(\Gamma_2\) given the intersection array of the graph \(\
Externí odkaz:
https://doaj.org/article/9af5fec77d8e4174b7e0e9d8cdede0d5
Autor:
Alexander A. Makhnev, Ivan N. Belousov
Publikováno v:
Ural Mathematical Journal, Vol 7, Iss 2 (2021)
A \(Q\)-polynomial Shilla graph with \(b = 5\) has intersection arrays \(\{105t,4(21t+1),16(t+1); 1,4 (t+1),84t\}\), \(t\in\{3,4,19\}\). The paper proves that distance-regular graphs with these intersection arrays do not exist. Moreover, feasible int
Externí odkaz:
https://doaj.org/article/becc78a618674e87bf944b8d6599add7
Publikováno v:
Ural Mathematical Journal, Vol 6, Iss 2 (2020)
In the class of distance-regular graphs of diameter 3 there are 5 intersection arrays of graphs with at most 28 vertices and noninteger eigenvalue. These arrays are \(\{18,14,5;1,2,14\}\), \(\{18,15,9;1,1,10\}\), \(\{21,16,10;1,2,12\}\), \(\{24,21,3;
Externí odkaz:
https://doaj.org/article/8948280c5cc2427a8f2e9909ac42b06b
Publikováno v:
Ural Mathematical Journal, Vol 3, Iss 1 (2017)
Makhnev and Samoilenko have found parameters of strongly regular graphs with no more than 1000 vertices, which may be neighborhoods of vertices in antipodal distance-regular graph of diameter 3 and with \(\lambda=\mu\). They proposed the program of i
Externí odkaz:
https://doaj.org/article/2fe8dcff68924c968918754b4ace19bf
For a distance-regular graph \(\Gamma\) of diameter 3, the graph \(\Gamma_i\) can be strongly regular for \(i=2\) or 3. J.Kulen and co-authors found the parameters of a strongly regular graph \(\Gamma_2\) given the intersection array of the graph \(\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa3724cbddbb906e2a808ebaa25b781b
https://umjuran.ru/index.php/umj/article/view/463
https://umjuran.ru/index.php/umj/article/view/463
Publikováno v:
Ural Mathematical Journal, Vol 3, Iss 1 (2017)
Makhnev and Samoilenko have found parameters of strongly regular graphs with no more than 1000 vertices, which may be neighborhoods of vertices in antipodal distance-regular graph of diameter 3 and with λ=μ. They proposed the program of investigati
Publikováno v:
Chinese Annals of Mathematics, Series B. 35:885-894
Let H be a subgroup of a finite group G. H is nearly SS-embedded in G if there exists an S-quasinormal subgroup K of G, such that HK is S-quasinormal in G and H ∩ K ≤ H seG , where H seG is the subgroup of H, generated by all those subgroups of H
Publikováno v:
Electronic Notes in Discrete Mathematics. 43:227-230
It is consider edge-symmetric distance-regular graph Γ with intersection array { k , ( r − 1 ) μ , 1 ; 1 , μ , k } . Let G = Aut ( Γ ) . Then G acts two-transitively on the set Σ of antipodal classes (fibres) of Γ. This graphs are classified
Publikováno v:
Discrete Mathematics and Applications. 24