Zobrazeno 1 - 10
of 339
pro vyhledávání: '"Ghorbani E"'
Publikováno v:
Journal of Pain Research, Vol Volume 13, Pp 65-73 (2020)
Seyed Ahmad Raeissadat, 1 Elham Ghorbani, 2 Morteza Sanei Taheri, 3 Reza Soleimani, 3 Seyed Mansoor Rayegani, 2 Marzieh Babaee, 2 Sara Payami 4 1Physical Medicine and Rehabilitation Department, Shahid Modarres Hospital, Shahid Beheshti University of
Externí odkaz:
https://doaj.org/article/e778a617af954d349b4deb253e5855b7
Publikováno v:
In Journal of Combinatorial Theory, Series A February 2025 210
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 t
Externí odkaz:
http://arxiv.org/abs/1908.04037
Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the spectral
Externí odkaz:
http://arxiv.org/abs/1907.03733
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. A reduced graph $G$ is said to be maximal if any reduced graph contain
Externí odkaz:
http://arxiv.org/abs/1903.07355
Publikováno v:
Electron. J. Comb. 27(1) 2020, #P1.29(1-28)
A $[t]$-trade is a pair $T=(T_+, T_-)$ of disjoint collections of subsets (blocks) of a $v$-set $V$ such that for every $0\le i\le t$, any $i$-subset of $V$ is included in the same number of blocks of $T_+$ and of $T_-$. It follows that $|T_+| = |T_-
Externí odkaz:
http://arxiv.org/abs/1810.02296
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
Externí odkaz:
http://arxiv.org/abs/1803.00245
Publikováno v:
In European Journal of Combinatorics June 2021 95
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. We determine the maximum order of reduced triangle-free graphs with a
Externí odkaz:
http://arxiv.org/abs/1404.3553
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with nullity 2 and 3
Externí odkaz:
http://arxiv.org/abs/1207.1802