Magical Tome

The outer archives are busy
A graph G consists of a nonempty set V(G) of elements, called vertices or nodes, and a set E(G) of elements called edges, together with a relation of incidence that associates with each edge two vertices, called its ends.
Create a free account to see Match Scores on books the community has marked — once you’ve set your preferences.
Create free accountMarks left by readers of this tome
No community marks yet — be the first to inscribe this tome.
Pacing
Horror / Dark Elements
Romance
Spice Level
LGBTQ+ Representation
Social & Political Themes in Stories