On the Component Number of Links from Plane Graphs
classification
🧮 math.CO
math.GT
keywords
graphnumberarisingcomponentcomponentselementaryequalgiven
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.