Graphs and topologies on discrete sets (Q1197054): Difference between revisions

A topology on the vertex set \(V\) of a graph \(G(V,E)\) is said to be compatible if whenever \(x,y\) are distinct elements of \(V\), then \(\{x,y\}\) is topologically connected if and only if \(\{x,y\}\in E\). The main result of Section 2 of this paper is the following: Let \(G(V,E)\) be a graph with a finite number of connected components and of finite degree at each vertex; \(G(V,E)\) admits a compatible topology on \(V\) if and only if \(G(V,E)\) is a comparability graph. Section 3 deals with the same problem in oriented graphs. Recent interest in Digital Topology has produced a number of papers dealing with the relation between graphs and \(T_ 0\) topologies on the vertex set but none of these are referenced; for example, the easy proof of the necessity of (a) in Property 1 has been noted by a number of authors most recently, see \textit{E. Khalimsky}, \textit{R. Kopperman} and \textit{P. R. Meyer} [Topology Appl. 36, No. 1, 1-17 (1990; Zbl 0709.54017)].