Zobrazeno 1 - 10
of 403
pro vyhledávání: '"Konstantinova, A. V."'
In this note we answer positively a question of Chris Godsil and Karen Meagher on the existence of a 2-design whose block graph has a non-canonical maximum clique without a design structure.
Externí odkaz:
http://arxiv.org/abs/2311.01190
Transposition graph $T_n$ is defined as a Cayley graph over the symmetric group generated by all transpositions. It is known that all eigenvalues of $T_n$ are integers. Moreover, zero is its eigenvalue for any $n\geqslant 4$. But the exact distributi
Externí odkaz:
http://arxiv.org/abs/2306.01627
The connected coalition in a graph $G=(V,E)$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$, neither of which is a connected dominating set but whose union $V_{1}\cup V_{2}$, is a connected dominating set. A connected coalition partiti
Externí odkaz:
http://arxiv.org/abs/2302.05754
The coalition in a graph $G$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$, neither of which is a dominating set but whose union $V_{1}\cup V_{2}$, is a dominating set. A coalition partition in a graph $G$ is a vertex partition $\pi$
Externí odkaz:
http://arxiv.org/abs/2212.10004
Autor:
Wang, Xiang, Konstantinova, Elena V.
V. Levenshtein first proposed the sequence reconstruction problem in 2001. This problem studies the model where the same sequence from some set is transmitted over multiple channels, and the decoder receives the different outputs. Assume that the tra
Externí odkaz:
http://arxiv.org/abs/2210.11864
Publikováno v:
Linear Algebra and its Applications, 2022
Transposition graph $T_n$ is defined as a Cayley graph over the symmetric group generated by all transpositions. It is known that all eigenvalues of $T_n$ are integers. However, an explicit description of the spectrum is unknown. In this paper we pro
Externí odkaz:
http://arxiv.org/abs/2204.03153
Autor:
Konstantinova, Elena V., Gun, Son En
Publikováno v:
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2022
The Pancake graphs $P_n, n\geqslant 2$, are Cayley graphs over the symmetric group $\mathrm{Sym}_n$ generated by prefix-reversals. There are six generating sets of prefix-reversals of cardinality three which give connected Cayley graphs over the symm
Externí odkaz:
http://arxiv.org/abs/2201.05733
We present a construction of Neumaier graphs with nexus 1, which generalises two known constructions of Neumaier graphs. We also use W. Wang, L. Qiu, and Y. Hu switching to show that we construct cospectral Neumaier graphs. Finally, we show that seve
Externí odkaz:
http://arxiv.org/abs/2109.13884
Publikováno v:
In Linear Algebra and Its Applications 1 June 2024 690:132-141
Publikováno v:
Discussiones Mathematicae - Graph Theory, 2021
In this paper an improved bound on the chromatic number of the Pancake graph $P_n, n\geqslant 2$, is presented. The bound is obtained using a subadditivity property of the chromatic number of the Pancake graph. We also investigate an equitable colori
Externí odkaz:
http://arxiv.org/abs/2103.11092