Edwin van Dam

activity

20122024

most citedOn almost distance-regular graphs

55 citations · 99 across the 11 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

Matching extension and distance spectral radius

Yuke Zhang, Edwin R. van Dam

A graph is called $k$ -extendable if each $k$ -matching can be extended to a perfect matching. We give spectral conditions for the $k$ -extendability of graphs and bipartite graphs us…

math.CO2023

Spectra of power hypergraphs and signed graphs via parity-closed walks

Lixiang Chen, Edwin R. van Dam, Changjiang Bu

The $k$ -power hypergraph $G^{(k)}$ is the $k$ -uniform hypergraph that is obtained by adding $k - 2$ new vertices to each edge of a graph $G$ , for $k \geq 3$ . A parity-closed walk in…