Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Leonid Shalaginov"'
Publikováno v:
Linear Algebra and its Applications. 610:222-226
We consider the symmetric group Sym Ω with Ω = { 1 , … , n } for any integer n ⩾ 2 and a set S = { ( 1 i ) , i ∈ { 2 , … , n } } . The Star graph S n = Cay ( Sym Ω , S ) is the Cayley graph over the symmetric group Sym Ω with the generati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::345018ab166b525110413be619414d27
https://doi.org/10.1016/j.laa.2020.09.042
https://doi.org/10.1016/j.laa.2020.09.042
Autor:
Elena V. Konstantinova, Saieed Akbari, Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh, Vladislav V. Kabanov, Leonid Shalaginov
Publikováno v:
Linear and Multilinear Algebra. 70:310-321
A Deza graph with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two of its vertices have b or a common neighbours, where b≥a. In this paper we investigate spectra of Deza ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b696db8790df7f18e82b8ed9d46f7cea
https://doi.org/10.1080/03081087.2020.1723472
https://doi.org/10.1080/03081087.2020.1723472
Autor:
Sergey Goryainov, Leonid Shalaginov, Vladislav V. Kabanov, Elena V. Konstantinova, Alexandr Valyuzhenich
Publikováno v:
Linear Algebra and its Applications. 586:7-27
We consider the symmetric group Sym n , n ⩾ 2 , generated by the set S of transpositions ( 1 i ) , 2 ⩽ i ⩽ n , and the Cayley graph S n = C a y ( Sym n , S ) called the Star graph. For any positive integers n ⩾ 3 and m with n > 2 m , we prese
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f16a668c9d0d9c87906ac377d4f5d82
https://doi.org/10.1016/j.laa.2019.10.018
https://doi.org/10.1016/j.laa.2019.10.018
Let GP$(q^2,m)$ be the $m$-Paley graph defined on the finite field with order $q^2$. We study eigenfunctions and maximal cliques in generalised Paley graphs GP$(q^2,m)$, where $m \mid (q+1)$. In particular, we explicitly construct maximal cliques of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46527273465d7f013835ff29833505b4
Autor:
Dmitry Panasenko, Leonid Shalaginov
A $k$-regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbors, and two vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7a518cb347625aa8f169680a9a039248
http://arxiv.org/abs/2109.12805
http://arxiv.org/abs/2109.12805
Publikováno v:
European Journal of Combinatorics. 80:194-202
A non-empty k -regular graph Γ on n vertices is called a Deza graph if there exist constants b and a ( b ≥ a ) such that any pair of distinct vertices of Γ has either b or a common neighbours. The quantities n , k , b , and a are called the param
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69781df9107c16dc3bb9bac6ca391e5f
https://doi.org/10.1016/j.ejc.2018.07.011
https://doi.org/10.1016/j.ejc.2018.07.011
Publikováno v:
Journal of Combinatorial Designs. 27:188-202
A Deza graph with parameters (n, k, b, a) is a k-regular graph with n vertices, in which any two vertices have a or b (a 1, where beta is the number of vertices with b common neighbours with a given vertex. Here, we start with a characterisation of D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b892d70fb1d32c1e5d36b6ce0d7d2ff8
https://doi.org/10.1002/jcd.21644
https://doi.org/10.1002/jcd.21644
Let $q$ be an odd prime power. Denote by $r(q)$ the value of $q$ modulo 4. In this paper, we establish a linear fractional correspondence between two types of maximal cliques of size $\frac{q+r(q)}{2}$ in the Paley graph of order $q^2$.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e846357b2481a632f8c93d79537eec6c
http://arxiv.org/abs/2102.03822
http://arxiv.org/abs/2102.03822
Autor:
Elena V. Konstantinova, Mohammad Ali Hosseinzadeh, Vladislav V. Kabanov, Willem H. Haemers, Leonid Shalaginov, Saieed Akbari
Publikováno v:
Discrete Mathematics, 344(12):112622. Elsevier
A Deza graph G with parameters ( n , k , b , a ) is a k-regular graph with n vertices such that any two distinct vertices have b or a common neighbours. The children G A and G B of a Deza graph G are defined on the vertex set of G such that every two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7953a90ccb188ca4bc328f3c8bfb3835
Autor:
Leonid Shalaginov
A $k$-regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbors, and two vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51f4218d847de9ebc067c14e06a30730