M. Fakharan

collaborators

2 papers

math.CO2021

A bound for the $p$ -domination number of a graph in terms of its eigenvalue multiplicities

A. Abiad, S. Akbari, M. H. Fakharan +1

Let $G$ be a connected graph of order $n$ with domination number $γ (G)$ . Wang, Yan, Fang, Geng and Tian [Linear Algebra Appl. 607 (2020), 307-318] showed that for any Laplacian eig…

math.CO2019

Trees with a large Laplacian eigenvalue multiplicity

S. Akbari, E. R. van Dam, M. H. Fakharan

In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than $1$ are simple and also the mu…

A bound for the p-domination number of a graph in terms of its eigenvalue multiplicities

Trees with a large Laplacian eigenvalue multiplicity

A bound for the $p$ -domination number of a graph in terms of its eigenvalue multiplicities