Search

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 distribution of the spectrum of the graph $T_n$ is unknown. In this paper we prove that integers from the interval $[-\frac{n-4}{2}, \frac{n-4}{2}]$ lie in the spectrum of $T_n$ if $n \geqslant 19$., Comment: 11 pages. arXiv admin note: text overlap with arXiv:2204.03153

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 partition in a graph $G$ of order $n=|V|$ is a vertex partition $\psi$ = $\{V_1, V_2,..., V_k \}$ such that every set $V_i \in \psi$ either is a connected dominating set consisting of a single vertex of degree $n-1$, or is not a connected dominating set but forms a connected coalition with another set $V_j\in \psi$ which is not a connected dominating set. The connected coalition number, denoted by $CC(G)$, is the maximum cardinality of a connected coalition partition of $G$. In this paper, we initiate the study of connected coalition in graphs and present some basic results. Precisely, we characterize all graphs that have a connected coalition partition. Moreover, we show that for any graph $G$ of order $n$ with $\delta(G)=1$ and with no full vertex, it holds that $CC(G)

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$ = $\{V_1, V_2,..., V_k \}$ such that every set $V_i \in \pi$ is not a dominating set but forms a coalition with another set $V_j\in \pi$ which is not a dominating set. The coalition number $C(G)$ equals the maximum $k$ of a coalition partition of $G$. In this paper, we compute the coalition number of all cubic graphs of order at most $10$., Comment: 14 pages, 3 figures

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 transmitted sequence is at distance $d$ from some code and there are at most $r$ errors in every channel. Then the sequence reconstruction problem is to find the minimum number of channels required to recover exactly the transmitted sequence that has to be greater than the maximum intersection between two metric balls of radius $r$, where the distance between their centers is at least $d$. In this paper, we study the sequence reconstruction problem of permutations under the Hamming distance. In this model we define a Cayley graph over the symmetric group, study its properties and find the exact value of the largest intersection of its two metric balls for $d=2r$. Moreover, we give a lower bound on the largest intersection of two metric balls for $d=2r-1$.

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 prove that for any integer $k\geqslant 0$ there exists $n_0$ such that for any $n\geqslant n_0$ and any $m \in \{0, \dots, k\}$, $m$ is an eigenvalue of $T_n$. In particular, it is proved that zero is an eigenvalue of $T_n$ for any $n\neq2$, and one is an eigenvalue of $T_n$ for any odd $n\geqslant 7$ and for any even $n \geqslant 14$. We also present exact values of the third and the fourth largest eigenvalues of $T_n$ with their multiplicities.

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 symmetric group known as cubic Pancake graphs. In this paper we study the girth of the cubic Pancake graphs. It is proved that considered cubic Pancake graphs have the girths at most twelve.

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 several small strictly Neumaier graphs can be obtained from our construction, and give a geometric or algebraic description for each of these graphs.

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 coloring of $P_n$. An equitable $(n-1)$-coloring based on efficient dominating sets is given and optimal equitable $4$-colorings are considered for small $n$. It is conjectured that the chromatic number of $P_n$ coincides with its equitable chromatic number for any $n\geqslant 2$.

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 distinct vertices are adjacent in $G_A$ or $G_B$ if and only if they have $a$ or $b$ common neighbours, respectively. A strongly Deza graph is a Deza graph with strongly regular children. In this paper we give a spectral characterisation of strongly Deza graphs, show relationships between eigenvalues, and study strongly Deza graphs which are distance-regular.

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, where b >= a. The children G_A and G_B of a Deza graph G are defined on the vertex set of G such that every two distinct vertices are adjacent in G_A or G_B if and only if they have a or b common neighbours, respectively. In this paper we present a general approach to dual Seidel switching and investigate Deza graphs whose children are strongly regular graphs., Comment: 8 pages

The Star graph $S_n$, $n\ge 3$, is the Cayley graph on the symmetric group $Sym_n$ generated by the set of transpositions $\{(12),(13),\ldots,(1n)\}$. In this work we study eigenfunctions of $S_n$ corresponding to the second largest eigenvalue $n-2$. For $n\ge 8$ and $n=3$, we find the minimum cardinality of the support of an eigenfunction of $S_n$ corresponding to the second largest eigenvalue and obtain a characterization of eigenfunctions with the minimum cardinality of the support.

Dual Seidel switching is a graph operation introduced by W.~Haemers in 1984. This operation can change the graph, however it does not change its bipartite double, and because of this, the operation leaves the squares of the eigenvalues invariant. Thus, if a graph is integral then it is still integral after dual Seidel switching. In this paper two new infinite families of integral graphs are obtained by applying dual Seidel switching to the Star graphs and the Odd graphs. In particular, three new $4$-regular integral graphs with their spectra are found.

The Bubble-sort graph $BS_n,\,n\geqslant 2$, is a Cayley graph over the symmetric group $Sym_n$ generated by transpositions from the set $\{(1 2), (2 3),\ldots, (n-1 n)\}$. It is a bipartite graph containing all even cycles of length $\ell$, where $4\leqslant \ell\leqslant n!$. We give an explicit combinatorial characterization of all its $4$- and $6$-cycles. Based on this characterization, we define generalized prisms in $BS_n,\,n\geqslant 5$, and present a new approach to construct a Hamiltonian cycle based on these generalized prisms., Comment: 13 pages, 7 figures