Zobrazeno 1 - 10
of 157
pro vyhledávání: '"Shirazi, A. N."'
Autor:
Lin, Jephian C. -H., Shirazi, Mahsa N
Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering, and findi
Externí odkaz:
http://arxiv.org/abs/2410.09736
Autor:
Gunderson, Karen, Meagher, Karen, Morris, Joy, Pantangi, Venkata Raghu Tej, Shirazi, Mahsa N.
The Erd\H{o}s--Ko--Rado (EKR) theorem and its generalizations can be viewed as classifications of maximum independent sets in appropriately defined families of graphs, such as the Kneser graph $K(n,k)$. In this paper, we investigate the independence
Externí odkaz:
http://arxiv.org/abs/2406.15739
Autor:
Fallat, Shaun, Joshi, Neha, Maleki, Roghayeh, Meagher, Karen, Mojallal, Seyed Ahmad, Nasserasr, Shahla, Shirazi, Mahsa N., Razafimahatratra, Andriaherimanana Sarobidy, Stevens, Brett
Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at minimal cost. Originally this game was conceived as a one player game, but later a two-player version was devised in-conjuncti
Externí odkaz:
http://arxiv.org/abs/2306.01138
Autor:
Shirazi, Mahsa N.
Two perfect matchings $P$ and $Q$ of the complete graph on $2k$ vertices are said to be set-wise $t$-intersecting if there exist edges $P_{1}, \cdots, P_{t}$ in $P$ and $Q_{1}, \cdots, Q_{t}$ in $Q$ such that the union of edges $P_{1}, \cdots, P_{t}$
Externí odkaz:
http://arxiv.org/abs/2110.02175
A $(k,\ell)$-partition is a set partition which has $\ell$ blocks each of size $k$. Two uniform set partitions $P$ and $Q$ are said to be partially $t$-intersecting if there exist blocks $P_{i}$ in $P$ and $Q_{j}$ in $Q$ such that $\left| P_{i} \cap
Externí odkaz:
http://arxiv.org/abs/2108.07692
Autor:
Fallat, Shaun, Joshi, Neha, Maleki, Roghayeh, Meagher, Karen, Mojallal, Seyed Ahmad, Nasserasr, Shahla, Shirazi, Mahsa N., Razafimahatratra, Andriaherimanana Sarobidy, Stevens, Brett
Publikováno v:
In Discrete Applied Mathematics 15 May 2024 348:91-104
A perfect matching in the complete graph on $2k$ vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect matchings are said to be $t$-intersecting if they have at least $t$ edges
Externí odkaz:
http://arxiv.org/abs/2008.08503
Autor:
Ronan, William, McGrath, Donnacha J., Shirazi, Reyhaneh N., Clancy, Marie, Dickenson, Roger C., McHugh, Peter E.
Publikováno v:
In European Journal of Mechanics / A Solids November-December 2023 102
Publikováno v:
International Journal of Engineering Transactions C: Aspects; Sep2024, Vol. 37 Issue 9, p1821-1831, 11p
Autor:
Shirazi, Reyhaneh N., McGrath, Donnacha J., Clancy, Marie, Higgins, Caroline, Mooney, Ivan, Dickenson, Roger C., McHugh, Peter E., Ronan, William
Publikováno v:
In Journal of the Mechanics and Physics of Solids June 2021 151