The Cycle Spaces of an Infinite Graph

The edge space of a finite graph <em>G</em> = (<em>V</em>, <em>E</em>) over a field F is simply an assignment of field elements to the edges of the graph. The edge space can equally be thought of us an |<em>E</em>|-dimensional vector space over F....

Full description

Bibliographic Details
Main Author: Casteels, Karel
Language:en
Published: University of Waterloo 2006
Subjects:
Online Access:http://hdl.handle.net/10012/1115
id ndltd-LACETR-oai-collectionscanada.gc.ca-OWTU.10012-1115
record_format oai_dc
spelling ndltd-LACETR-oai-collectionscanada.gc.ca-OWTU.10012-11152014-06-18T03:51:12Z The Cycle Spaces of an Infinite Graph Casteels, Karel Mathematics The edge space of a finite graph <em>G</em> = (<em>V</em>, <em>E</em>) over a field F is simply an assignment of field elements to the edges of the graph. The edge space can equally be thought of us an |<em>E</em>|-dimensional vector space over F. The cycle space and bond space are the subspaces of the edge space generated by the cycle and bonds of the graph respectively. It is easy to prove that the cycle space and bond space are orthogonal complements. <br /><br /> Unfortunately many of the basic results in finite dimensional vector spaces no longer hold in infinite dimensions. Therefore extending the cycle and bond spaces to infinite graphs is not at all a trivial exercise. <br /><br /> This thesis is mainly concerned with the algebraic properties of the cycle and bond spaces of a locally finite, infinite graph. Our approach is to first topologize and then compactify the graph. This allows us to enrich the set of cycles to include infinite cycles. We introduce two cycle spaces and three bond spaces of a locally finite graph and determine the orthogonality relations between them. We also determine the sum of two of these spaces, and derive a version of the Edge Tripartition Theorem. 2006-08-22T14:28:44Z 2006-08-22T14:28:44Z 2006 2006 Thesis or Dissertation http://hdl.handle.net/10012/1115 en Copyright: 2006, Casteels, Karel. All rights reserved. University of Waterloo
collection NDLTD
language en
sources NDLTD
topic Mathematics
spellingShingle Mathematics
Casteels, Karel
The Cycle Spaces of an Infinite Graph
description The edge space of a finite graph <em>G</em> = (<em>V</em>, <em>E</em>) over a field F is simply an assignment of field elements to the edges of the graph. The edge space can equally be thought of us an |<em>E</em>|-dimensional vector space over F. The cycle space and bond space are the subspaces of the edge space generated by the cycle and bonds of the graph respectively. It is easy to prove that the cycle space and bond space are orthogonal complements. <br /><br /> Unfortunately many of the basic results in finite dimensional vector spaces no longer hold in infinite dimensions. Therefore extending the cycle and bond spaces to infinite graphs is not at all a trivial exercise. <br /><br /> This thesis is mainly concerned with the algebraic properties of the cycle and bond spaces of a locally finite, infinite graph. Our approach is to first topologize and then compactify the graph. This allows us to enrich the set of cycles to include infinite cycles. We introduce two cycle spaces and three bond spaces of a locally finite graph and determine the orthogonality relations between them. We also determine the sum of two of these spaces, and derive a version of the Edge Tripartition Theorem.
author Casteels, Karel
author_facet Casteels, Karel
author_sort Casteels, Karel
title The Cycle Spaces of an Infinite Graph
title_short The Cycle Spaces of an Infinite Graph
title_full The Cycle Spaces of an Infinite Graph
title_fullStr The Cycle Spaces of an Infinite Graph
title_full_unstemmed The Cycle Spaces of an Infinite Graph
title_sort cycle spaces of an infinite graph
publisher University of Waterloo
publishDate 2006
url http://hdl.handle.net/10012/1115
work_keys_str_mv AT casteelskarel thecyclespacesofaninfinitegraph
AT casteelskarel cyclespacesofaninfinitegraph
_version_ 1716669949804544000