Article thumbnail

Parity and disparity subgraphs

By Terry A. McKee and Lutz Volkmann

Abstract

AbstractA parity subgraph of a graph is a spanning subgraph such that the degrees of each vertex have the same parity in both the subgraph and the original graph. Known results include that every graph has an odd number of minimal parity subgraphs. Define a disparity subgraph to be a spanning subgraph such that each vertex has degrees of opposite parities in the subgraph and the original graph. (Only graphs with all even-order components can have disparity subgraphs). Every even-order spanning tree contains both a unique parity subgraph and a unique disparity subgraph. Moreover, every minimal disparity subgraph is shown to be paired by sharing a spanning tree with an odd number of minimal parity subgraphs, and every minimal parity subgraph is similarly paired with either one or an even number of minimal disparity subgraphs

Publisher: Elsevier B.V.
Year: 2009
DOI identifier: 10.1016/j.disc.2008.03.028
OAI identifier:

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.