<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T19:57:44Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1033" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1033</identifier><datestamp>2017-03-21T19:12:11Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="66a0d35c-1adb-4262-b56f-d79af2ab1bc7" confidence="600">Vella, Antoine</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:22:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:22:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1033</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We adopt a novel topological approach for graphs, in which edges are modelled as points  as opposed to arcs.   The model of classical &amp;lt;i&amp;gt;topologized graphs&amp;lt;/i&amp;gt; translates graph isomorphism  into topological homeomorphism, so that &amp;lt;i&amp;gt;all&amp;lt;/i&amp;gt; combinatorial concepts are expressible  in purely topological language.   This allows us to extrapolate concepts from finite graphs  to infinite graphs equipped with a compatible topology, which, dropping the classical  requirement, need not be unique.   We bring standard concepts from general topology to  bear upon questions of a combinatorial inspiration, in an infinite setting.      
We show how (possibly finite) graph-theoretic paths are, without any technical subterfuges,  a subclass of a broad category of topological spaces, namely paths, that includes  Hausdorff arcs, the real line and all connected orderable spaces (of arbitrary cardinality).    We show that all paths, and the topological generalizations of cycles, are topologized  graphs.   We use feeble regularity to explore relationships between the topologies on the  vertex set and the whole space.   We employ compactness and weak normality to prove  the existence of our analogues for minimal spanning sets and fundamental cycles.   In this  framework, we generalize theorems from finite graph theory to a broad class of topological  structures, including the facts that fundamental cycles are a basis for the cycle space,  and the orthogonality between bond spaces and cycle spaces.   We show that this can be  accomplished in a setup where the set of edges of a cycle has a loose relationship with  the cycle itself.   It turns out that, in our model, feeble regularity excludes several pathologies,  including one identified previously by Diestel and Kuehn, in a very different approach  which addresses the same issues.   Moreover, the spaces surgically constructed by the same  authors are feebly regular and, if the original graph is 2-connected, compact.   We consider  an attractive relaxation of the &amp;lt;i&amp;gt;T&amp;lt;/i&amp;gt;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; separation axiom, namely the &amp;lt;i&amp;gt;S&amp;lt;/i&amp;gt;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; axiom, which leads  to a topological universe parallel to the usual one in mainstream topology.   We use local  connectedness to unify graph-theoretic trees with the dendrites of continuum theory and  a more general class of well behaved dendritic spaces, within the class of &amp;lt;i&amp;gt;ferns&amp;lt;/i&amp;gt;.      
We generalize results of Whyburn and others concerning dendritic spaces to ferns, and  show how cycles and ferns, in particular paths, are naturally &amp;lt;i&amp;gt;S&amp;lt;/i&amp;gt;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; spaces, and hence may  be viewed as topologized hypergraphs.   We use topological separation properties with a  distinct combinatorial flavour to unify the theory of cycles, paths and ferns.   This we also  do via a setup involving total orders, cyclic orders and partial orders.   The results on  partial orders are similar to results of Ward and Muenzenberger and Smithson in the more  restrictive setting of Hausdorff dendritic spaces.   Our approach is quite different and, we  believe, lays the ground for an appropriate notion of completion which links Freudenthal  ends of ferns simultaneously with the work of Polat for non-locally-finite graphs and the  paper of Allen which recognizes the unique dendritic compactification of a rim-compact  dendritic space as its Freudenthal compactification.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">2379734 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2005, 
  Vella, Antoine. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">graph</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">topology</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cycle space</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">dendrite</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">A Fundamentally Topological Perspective on Graph Theory</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>