1 citations · 1 across the 15 of their papers we have counts for
17 papers
Orthogonal signed graphs of degree 5
Maxwell Levit, Bojan Mohar, Behruz Tayfeh-Rezaie
An orthogonal signed graph is a connected signed graph whose signed adjacency matrix has pairwise orthogonal rows. They are closely related to Hadamard matrices, maximal arrangemen…
-Neighbor Bootstrap Percolation on Odd Graphs
Ali Mohammadian, Sina Rezaie Zareie, Behruz Tayfeh-Rezaie
The -neighbor bootstrap percolation process on a graph is a vertex-activation process that begins with a set of initially active vertices. In each subsequent round, every in…
A search for Hadamard matrices of Williamson type
Hadi Kharaghani, Ali Mohammadian, Behruz Tayfeh-Rezaie
In this article, we consider a special class of Williamson type matrices which we call them near Williamson matrices. They are in fact four -matrices $A, B, C,…
On saturation numbers of complete multipartite graphs and even cycles
Ali Mohammadian, Milad Poursoltani, Behruz Tayfeh-Rezaie
Given positive integer and graph , the saturation number is the minimum number of edges in an edge-maximal -free graph on vertices. In this paper…
Bootstrap percolation on the Hamming graphs
Meysam Miralaei, Ali Mohammadian, Behruz Tayfeh-Rezaie
The -edge bootstrap percolation on a graph is an activation process of the edges. The process starts with some initially activated edges and then, in each round, any inactive ed…
On the classification of skew Hadamard matrices of order 36 and related structures
Makoto Araya, Masaaki Harada, Hadi Kharaghani +2
Two skew Hadamard matrices are considered {\sf SH}-equivalent if they are similar by a signed permutation matrix. This paper determines the number of {\sf SH}-inequivalent skew Had…