7 citations · 11 across the 5 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021★ 3 cited
Spectral radius and clique partitions of graphs
Jiang Zhou, Edwin R. van Dam
We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximu…
math.CO2021★ 1 cited
Unit gain graphs with two distinct eigenvalue and systems of lines in complex space
Pepijn Wissing, Edwin R. van Dam
Since the introduction of the Hermitian adjacency matrix for digraphs, interest in so-called complex unit gain graphs has surged. In this work, we consider gain graphs whose spectr…