On the Component Number of Links from Plane Graphs
Combinatorics
2014-11-14 v2 Geometric Topology
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.
Cite
@article{arxiv.1408.6815,
title = {On the Component Number of Links from Plane Graphs},
author = {Daniel S. Silver and Susan G. Williams},
journal= {arXiv preprint arXiv:1408.6815},
year = {2014}
}
Comments
Version 2 has minor changes, additional citations. 7 pages, 5 figures