6 papers
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…
Saturation numbers of bipartite graphs in random graphs
Meysam Miralaei, Ali Mohammadian, Behruz Tayfeh-Rezaie +1
For a given graph , the -saturation number of a graph , denoted by , is the minimum number of edges in an edge-maximal -free subgraph of . In 2017, Kor…
Hadamard matrices with few distinct types
A. Mohammadian, B. Tayfeh-Rezaie
The notion of type of quadruples of rows is proven to be useful in the classification of Hadamard matrices. In this paper, we investigate Hadamard matrices with few distinct types.…
Maximum order of triangle-free graphs with a given rank
E. Ghorbani, A. Mohammadian, B. Tayfeh-Rezaie
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors.…