Related papers: Semisymmetric cubic graphs of twice odd order
The divergence-like operator on an odd symplectic superspace which acts invariantly on a specially chosen odd vector field is considered. This operator is used to construct an odd invariant semidensity in a geometrically clear way. The…
In this paper, we classify connected amply regular graphs with diameter $d \geq 4$ and parameters $(v, k, \lambda, \mu)$ satisfying $\mu = \frac{k-1}{2}$, where $k\geq 5$ is odd. We prove that such a graph must be exactly one of the…
The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having…
Semiuniform semigroups provide a natural setting for the convolution of generalized finite measures on semigroups. A semiuniform semigroup is said to be ambitable if each uniformly bounded uniformly equicontinuous set of functions on the…
Indecomposible semifinite harmonic functions on the direct product of graded graphs are classified. As a particular case, the full list of indecomposible traces for the infinite inverse symmetric semigroup is obtained.
A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
In this paper we investigate graph inverse semigroups which are subsemigroups of compact-like topological semigroups. More precisely, we characterise graph inverse semigroups which admit a compact semigroup topology and describe graph…
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…
In this paper, we characterize completely the structure of Clifford semigroups of matrices over an arbitrary field. It is shown that a semigroups of matrices of finite order is a Clifford semigroup if and only if it is isomorphic to a…
Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
A class of subgroups is obtained for symmetric groups using signed Brauer diagrams.
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…
We generalize the classical semiregularity theorem of Buchweitz and Flenner to the setting of noncommutative algebraic geometry, with group actions. This applies in particular to twisted derived categories, in which case it answers a…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…
Let $G$ be a graph. A total dominating set of $G$ is a set $S$ of vertices of $G$ such that every vertex is adjacent to at least one vertex in $S$. The total domatic number of a graph is the maximum number of total dominating sets which…
Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…
In this paper, we investigate odd graceful graph, odd strongly harmonious graph, bipartite graph and their relationship. We proved following results: (1) if G is odd strongly harmonious graph, then G is odd graceful graph ;(2) if G is…