S. A. Mojallal

activity

20172026

most citedRiordan graphs II: Spectral properties

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

collaborators

Showing 2026Show all

5 papers · 1 filter

math.CO2026

A proof of the maximum Laplacian energy conjecture for connected graphs via a sharp eigenvalue-sum bound

Seyed Ahmad Mojallal

Let $S_{k} (G)$ denote the sum of the $k$ largest Laplacian eigenvalues of a connected graph $G$ of order $n$ and size $m$ . Write $PA_{n, ω}$ for the graph obtained from an $ω…

math.FA2026

Stability of maximal relative projection constants

Hitesh Kumar, Bojan Mohar, Seyed Ahmad Mojallal +1

For positive integers $n \geq r$ , let $λ (r, n)$ denote the \emph{maximal relative projection constant} of $r$ -dimensional subspaces of $ℓ_{\infty}^{n}$ and $λ (r)$ denote the \emph{maxi…

math.CO2026

Rank-Average Degree Bound for Graph Energy

Seyed Ahmad Mojallal

We prove that the energy $E (G)$ of any simple graph $G$ of order $n \geq 5$ satisfies \[ {\mathcal E}\ge r(G)+\bar d(G)-1, \] where $r (G)$ and $d ˉ (G)$ denote, respectiv…

math.CO2026

Extremal Graphs for the Energy-Independence Number Inequality

Seyed Ahmad Mojallal

For a graph $G$ of order $n$ , let $E (G)$ denote its adjacency energy and let $α (G)$ denote its independence number. A recent theorem of Kumar and Pragada states that $$\ma…

math.CO2026

Extremal graphs for the $k$ -th eigenvalue

Hitesh Kumar, Bojan Mohar, Seyed Ahmad Mojallal +1

For a simple graph $G$ of order $n$ , let $λ_{1} (G) \geq \dots \geq λ_{n} (G)$ denote its adjacency eigenvalues. Hong's problem asks for the optimal upper bound for $λ_{k} (G)$ . A recent theo…

A proof of the maximum Laplacian energy conjecture for connected graphs via a sharp eigenvalue-sum bound

Stability of maximal relative projection constants

Rank-Average Degree Bound for Graph Energy

Extremal Graphs for the Energy-Independence Number Inequality

Extremal graphs for the k-th eigenvalue

Extremal graphs for the $k$ -th eigenvalue