Related papers: On intriguing sets in five classes of strongly reg…
We consider imprimitive association schemes of class four which are two-fold covers of strongly regular graphs with spreads. It will be shown that a two-fold cover of a strongly regular graph with a spread provides a five class fission…
The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…
We determine the maximum number of maximal independent sets of arbitrary graphs in terms of their covering numbers and we completely characterize the extremal graphs. As an application, we give a similar result for K\"onig-Egerv\'ary graphs…
We completely determine the complexity status of the dominating set problem for hereditary graph classes defined by forbidden induced subgraphs with at most five vertices.
We analyse properties of geometric intersection graphs to show the strict containment between some natural classes of geometric intersection graphs. In particular, we show the following properties: - A graph $G$ is outerplanar if and only…
In this paper, we give constructions of strongly regular Cayley graphs and skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and our results generalize ten of the eleven sporadic…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
In this paper, we give a new lifting construction of "hyperbolic" type of strongly regular Cayley graphs. Also we give new constructions of strongly regular Cayley graphs over the additive groups of finite fields based on partitions of…
We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.
We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups $G_2(4)$ and $G_2(5)$, the orthogonal group $O(7,3)$ and the Tits group $T=$$^2F_4(2)'$. Most of the constructed…
We consider several graphs classes defined in terms of conditions on cliques and stable sets, including CIS, split, equistable, and other related classes. We pursue a systematic study of the relations between them. As part of this study, we…
We construct a strongly regular graph with the parameters (65; 32; 15; 16). The idea is to search for an adjacency matrix that consists of circulant blocks. Equations with such matrices can be reduced to congruences with polynomials…
In this article we show that non-singular quadrics and non-singular Hermitian varieties are completely characterized by their intersection numbers with respect to hyperplanes and spaces of codimension 2. This strongly generalizes a result…
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
We define a suitably tame class of singular symplectic curves in 4-manifolds, namely those whose singularities are modeled on complex curve singularities. We study the corresponding symplectic isotopy problem, with a focus on rational…
We call a simplicial complex algebraically rigid if its Stanley-Reisner ring admits no nontrivial infinitesimal deformations, and call it inseparable if does not allow any deformation to other simplicial complexes. Algebraically rigid…
It is known that the automorphism group of the elementary abelian $2$-group $Z_2^n$ is isomorphic to the general linear group $GL(n,F_2)$ of degree $n$ over $F_2$. Let $W$ be the collection of permutation matrices of order $n$. It is clear…
We study the relation between algebraic structures and Graph Theory. We have defined five different weighted digraphs associated to a finite dimensional algebra over a field in order to tackle important properties of the associated…
We compute the elementary divisors of the adjacency and Laplacian matrices of families of polar graphs. These graphs have as vertices the isotropic one-dimensional subspaces of finite vector spaces with respect to non-degenerate forms, with…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…