Edwin R. van Dam

collaborators

3 papers

math.CO2026

On the combinatorial structure of graphs with a spectral idempotent of small dual diameter

Edwin R. van Dam, Giusy Monzillo, Safet PenjiÄ

Let $I^$ be a connected regular graph with an eigenvalue $I^»$ and corresponding idempotent $E_{I^} »$ . Let $E_{I^} » = ⟨ J, E_{I^} » ⟩^{\circ}$ be the algebra generated by $J$ and…

math.CO2025

Spectral condition for $k$ -factor-criticality in $t$ -connected graphs

Tingyan Ma, Edwin R. van Dam, Ligong Wang

A graph $G$ is called $k$ -factor-critical if $G - S$ has a perfect matching for every $S \subseteq G$ with $∣ S ∣ = k$ . A connected graph $G$ is called $t$ -connected if it has more than $…

math.CO2025

Rainbow Hamiltonicity and the spectral radius

Yuke Zhang, Edwin R. van Dam

Let $G = {G_{1}, \dots, G_{n}}$ be a family of graphs of order $n$ with the same vertex set. A rainbow Hamiltonian cycle in $G$ is a cycle that visits each vertex p…

On the combinatorial structure of graphs with a spectral idempotent of small dual diameter

Spectral condition for k-factor-criticality in t-connected graphs

Rainbow Hamiltonicity and the spectral radius

Spectral condition for $k$ -factor-criticality in $t$ -connected graphs