Ebrahim Ghorbani

Ebrahim Ghorbani

Auto-generated profile, based on publicly available information

Ebrahim Ghorbani

Department of Mathematics K.N. Toosi University of Technology P.O. Box 16315 -1618 Tehran Iran

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 October 2013 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
BCBai Fan Chen
Bai Fan Chen
EGEbrahim Ghorbani
Ebrahim Ghorbani
KWKok Bin Wong
Kok Bin Wong
The $(n,k)$-arrangement graph $A(n,k)$ is a graph with all the $k$-permutations of an $n$-element set as vertices where two $k$-permutations are adjacent if they agree in exactly $k-1$ positions. We introduce a cyclic decomposition for $k$-permutations and show that this gives rise to a very fine equitable partition of $A(n,k)$. This equitable partition can be employed to compute the complete set of eigenvalues (of the adjacency matrix) of $A(n,k)$. Consequently, we determine the eigenvalues of $A(n,k)$ for small values of $k$. Finally, we show that any eigenvalue of the Johnson graph $J(n,k)$ is an eigenvalue of $A(n,k)$ and that $-k$ is the smallest eigenvalue of $A(n,k)$ with multiplicity ${\cal O}(n^k)$ for fixed $k$.

9 March 2013 in arXiv
Verified
Preprint
Open access
PDF file
RBRavindra Bapat
Ravindra Bapat
EGEbrahim Ghorbani
Ebrahim Ghorbani
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular triangular matrices A such that A and A^{-1} have the same zero-nonzero pattern are characterized. A combinatorial construction is given to construct outer inverses of the adjacency matrix of a weighted tree.

9 November 2013 in arXiv
Verified
Preprint
Open access
PDF file
BCBai Fan Chen
Bai Fan Chen
EGEbrahim Ghorbani
Ebrahim Ghorbani
KWKok Bin Wong
Kok Bin Wong
The (n,k)-arrangement graph A(n,k) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are adjacent if they agree in exactly k-1 positions. We introduce a cyclic decomposition for k-permutations and show that this gives rise to a very fine equitable partition of A(n,k). This equitable partition can be employed to compute the complete set of eigenvalues (of the adjacency matrix) of A(n,k). Consequently, we determine the eigenvalues of A(n,k) for small values of k. Finally, we show that any eigenvalue of the Johnson graph J(n,k) is an eigenvalue of A(n,k) and that -k is the smallest eigenvalue of A(n,k) with multiplicity O(n^k) for fixed k.

10 November 2020 in arXiv
Verified
Preprint
Open access
PDF file
MGMohammad Farrokhi Derakhshandeh Ghouchan
Mohammad Farrokhi Derakhshandeh Ghouchan
EGE. Ghorbani
E. Ghorbani
HMH. R. Maimani
H. R. Maimani
FMF. Rahimi Mahid
F. Rahimi Mahid
This paper deals with some of the algebraic properties of Sierpi\'nski graphs and a family of regular generalized Sierpi\'nski graphs. For the family of regular generalized Sierpi\'nski graphs, we obtain their spectrum and characterize those graphs that are Cayley graphs. As a by-product, a new family of non-Cayley vertex-transitive graphs, and consequently, a new set of non-Cayley numbers are introduced. We also obtain the Laplacian spectrum of Sierpi\'nski graphs in some particular cases, and make a conjecture on the general case.

1 March 2018 in arXiv
Verified
Preprint
Open access
PDF file
MAMilica Andelic
Milica Andelic
EGE. Ghorbani
E. Ghorbani
SSS. K. Simić
S. K. Simić
A graph is called a chain graph if it is bipartite and the neighborhoods of the vertices in each color class form a chain with respect to inclusion. A threshold graph can be obtained from a chain graph by making adjacent all pairs of vertices in one color class. Given a graph $G$, let $\lambda$ be an eigenvalue (of the adjacency matrix) of $G$ with multiplicity $k \geq 1$. A vertex $v$ of $G$ is a downer, or neutral, or Parter depending whether the multiplicity of $\lambda$ in $G-v$ is $k-1$, or $k$, or $k+1$, respectively. We consider vertex types in the above sense in threshold and chain graphs. In particular, we show that chain graphs can have neutral vertices, disproving a conjecture by Alazemi {\em et al.}

13 November 2011 in arXiv
Verified
Preprint
Open access
PDF file
NGN. Ghareghani
N. Ghareghani
EGE. Ghorbani
E. Ghorbani
MMM. Mohammad-Noori
M. Mohammad-Noori
Several intersection matrices of $s$-subsets vs. $k$-subsets of a $v$-set are introduced in the literature. We study these matrices systematically through counting arguments and generating function techniques. A number of new or known identities appear as natural consequences of this viewpoint; especially, appearance of the derivative operator $d/dz$ and some related operators reveals some connections between intersection matrices and the "combinatorics of creation-annihilation". As application, the eigenvalues of several intersection matrices including some generalizations of the adjacency matrices of the Johnson scheme are derived; two new bases for the Bose--Mesner algebra of the Johnson scheme are introduced and the associated intersection numbers are obtained as well. Finally, we determine the rank of some intersection matrices.