REVIEW 1 cited by
Eigenvalues of Cayley graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
Forward citations
Cited by 1 Pith paper
-
Active Learning on Adversarially Corrupted Graphs
A poly-time active learning algorithm approximately recovers adversarially corrupted vertices with query complexity polynomial in the adversary's neighborhood budget and the clean graph's vertex expansion.
Discussion (0). Sign in to comment.