S. A. Mojallal

collaborators

5 papers

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…

math.CO2026

Forts, (fractional) zero forcing, and Cartesian products of graphs

Thomas R. Cameron, Leslie Hogben, Franklin H. J. Kenter +2

The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number. The fort hypergraph is…

cs.LG2025

Distance-based Learning of Hypertrees

Shaun Fallat, Kamyar Khodamoradi, David Kirkpatrick +3

We study the problem of learning hypergraphs with shortest-path queries (SP-queries), and present the first provably optimal online algorithm for a broad and natural class of hyper…

Rank-Average Degree Bound for Graph Energy

Extremal Graphs for the Energy-Independence Number Inequality

Extremal graphs for the k-th eigenvalue

Forts, (fractional) zero forcing, and Cartesian products of graphs

Distance-based Learning of Hypertrees

Extremal graphs for the $k$ -th eigenvalue