On the Component Number of Links from Plane Graphs
Abstract
A short, elementary proof is given of the result: The number of components of a link arising from a medial graph M(G) by resolving vertices is equal to the nullity of the mod-2 Laplacian matrix of the graph G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.