Tiling of Prime and Composite Kirchhoff GraphsPublic
Downloadable Contentopen in viewer
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. We present an algorithm that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. We explore the tiling of prime Kirchhoff graphs. Specifically, we show the existence of countably infinitely many prime Kirchhoff graphs given a set of initial fundamental Kirchhoff graphs. We also explore the minimal multiplicity for which nontrivial Kirchhoff graphs exist.
- This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
- Date created
- Resource type
- Rights statement
- In Collection:
|Thumbnail||Title||Visibility||Embargo Release Date||Actions|
Permanent link to this page: https://digital.wpi.edu/show/d504rp59x