Perfect matchings after vertex deletions in n-dimensional lattice graphs
This thesis studies lattice graphs which are readily seen to have many perfect matchings and considers whether if we delete vertices the resulting graphs continue to have perfect matchings. It is clear that one can destroy the property of having a perfect matching by deleting an odd number of ver...
Main Author: | Yang, Hangjun |
---|---|
Language: | English |
Published: |
2009
|
Online Access: | http://hdl.handle.net/2429/16911 |
Similar Items
-
Strongly Eutactic Lattices From Vertex Transitive Graphs
by: Xin, Yuxin
Published: (2019) -
Rainbow perfect domination in lattice graphs
by: Luis R. Fuentes, et al.
Published: (2018-04-01) -
Characterization of perfect matching transitive graphs
by: Ju Zhou
Published: (2018-10-01) -
Effect of vertex deletion on the weak Roman domination number of a graph
by: P. Roushini Leely Pushpam, et al.
Published: (2019-08-01) -
Effect of vertex deletion on the weak Roman domination number of a graph
by: P. Roushini Leely Pushpam, et al.
Published: (2019-08-01)