Self-Converse Directed BIBDs with Block Size Four

A directed balanced incomplete block design (or D B(k,;v)) (X,) is called self-converse if there is an isomorphic mapping f from (X,) to (X,^–1), where ^–1={B ^–1:B} and B ^–1=(x _k ,x _{k –1},,x ₂,x ₁) for B=(x ₁,x ₂,,x _{k –1},x _k ). In this paper, we give the existence spectrum for self-converse D B(4,1;v). AMS Classification:05BResearch supported in part by NSFC Grant 10071002 and SRFDP under No. 20010004001     

Self-converse mixed graphs are extremely rare

A mixed graph is cospectral to its converse, with respect to the usual adjacency matrices. Hence, it is easy to see that a mixed graph whose eigenvalues occur uniquely, up to isomorphism, must be isomorphic to its converse. It is therefore natural to ask whether or not this is a common phenomenon. This note contains the theoretical evidence to confirm that the fraction of self-converse mixed graphs tends to zero.     

Spectral characterizations of tournaments

Characterizing graphs by the spectra of various matrices associated with the graphs has long been an important topic in spectral graph theory. However, it is generally very hard to show a given graph to be determined by its spectrum. This paper gives a simple criterion for a tournament to be determined by its adjacency spectrum. More precisely, let G be a tournament of order n with adjacency matrix A, and $W_A(G)=[e,Ae,...,A^{n?1}e]$ be its walk matrix, where e is the all-one vector. We show that, for any self-converse tournament G, if $\det ?W_A(G)$ is square-free, then G is uniquely determined by its adjacency spectrum among all tournaments. The result is somewhat unexpected, which was achieved by employing some recent tools developed by the second author for showing a graph to be determined by its generalized spectrum. The key observation is that for a tournament G, the complement of G coincides with the converse of G, and hence a certain equivalence between the ordinary adjacency spectrum and the generalized (skew)-adjacency spectrum for G can be established. Moreover, some equivalent formulations of the above result, as well as some related ones are also presented.     

The spectrum for self-converse large set of pure Mendelsohn triple systems

An $LPMTS(v,\lambda )$ is a collection of $\frac{v-2}{\lambda }$ disjoint pure Mendelsohn triple system $PMTS(v,\lambda )s$ on the same set of v elements. An $LPMT{S}^{⁎}(v)$ is a special $LPMTS(v,1)$ which contains exactly $\frac{v-2}{2}$ converse pairs of $PMTS(v)s$. In this paper, we mainly discuss the existence of an $LPMT{S}^{⁎}(v)$ for $v\equiv 6,10\mathrm{mod 12}$ and get the following conclusions: (1) there exists an $LPMT{S}^{⁎}(v)$ if and only if $v\equiv 0,4\mathrm{mod 6},v\ge 4$ and $v\ne 6$. (2) There exists an $LPMTS(v,\lambda )$ with index $\lambda \equiv 2,4\mathrm{mod 6}$ if and only if $v\equiv 0,4\mathrm{mod 6},v\ge 2\lambda +2,v\equiv 2\mathrm{mod}\mathit{\lambda }$.     

Self-converse large sets of pure directed triple systems

An $LPDTS(v,\lambda )$ is a collection of $\frac{3(v?2)}{\lambda }$ pairwise disjoint $PDTS(v,\lambda )s$ on the same set of v elements. An $LPDT{S}^{?}(v)$ is a special $LPDTS(v,1)$ which contains exactly $\frac{v?2}{2}$ converse hexads of $PDTS(v)s$. In this paper, we mainly discuss the existence of an $LPDT{S}^{?}(v)$ and get the following conclusions: (1) there exists an $LPDT{S}^{?}(v)$ if and only if $v\equiv 0,4\mathrm{mod 6},v\ge 4$ except possibly $v=30$. (2) There exists an $LPDTS(v,\lambda )$ with index $\lambda \equiv 2,4\mathrm{mod 6}$ if and only if $v\equiv 0,4\mathrm{mod 6},v\ge 2\lambda +2,v\equiv 2\mathrm{mod}\mathit{\lambda }$ except possibly $v=30$.