M. Einollahzadeh

activity

20162021

most citedProof of a conjecture on the algebraic connectivity of a graph and its complement

2 citations · 3 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2021★ 1 cited

An improved lower bound for the Seidel energy of tree graphs

M. Einollahzadeh, M. A. Nematollahi

Let $G$ be a graph with the vertex set ${v_{1}, \dots, v_{n}}$ . The Seidel matrix of $G$ is an $n \times n$ matrix whose diagonal entries are zero, $ij$ -th entry is $- 1$ i…

math.CO2019

Proof of a Conjecture on the Seidel Energy of Graphs

Saieed Akbari, Mostafa Einollahzadeh, Mohammad Mahdi Karkhaneei +1

Let $G$ be a graph with the vertex set ${v_{1}, \dots, v_{n}}$ . The Seidel matrix of $G$ is an $n \times n$ matrix whose diagonal entries are zero, $ij$ -th entry is $- 1$ i…

math.CO2019★ 2 cited

Proof of a conjecture on the algebraic connectivity of a graph and its complement

Mostafa Einollahzadeh, Mohammad Mahdi Karkhaneei

For a graph $G$ , let $λ_{2} (G)$ denote its second smallest Laplacian eigenvalue. It was conjectured that $λ_{2} (G) + λ_{2} (G) \geq 1$ , where $G ˉ$ is the complement of $G$ …

math.CT2016

Tannakian formalism for fiber functors over tensor categories

Mostafa Einollahzadeh, Amir Jafari

In this paper we generalize Tannakian formalism to fiber functors over general tensor categories. We will show that (under some technical conditions) if the fiber functor has a sec…