首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Graphs without isometric rays and invariant subgraph properties,I
Authors:Norbert Polat
Abstract:A ray of a graph G is isometric if every path in R is a shortest path in G. A vertex x of G geodesically dominates a subset A of V(G) if, for every finite SV(Gx), there exists an element a of A − {x} such that the interval (set of vertices of all shortest paths) between x and a is disjoint from S. A set AV(G) is geodesically closed if it contains all vertices which geodesically dominate A. These geodesically closed sets define a topology, called the geodesic topology, on V(G). We prove that a connected graph G has no isometric rays if and only if the set V(G) endowed with the geodesic topology is compact, or equivalently if and only if the vertex set of every ray in G is geodesically dominated. We prove different invariant subgraph properties for graphs containing no isometric rays. In particular we show that every self-contraction (map which preserves or contracts the edges) of a chordal graph G stabilizes a non-empty finite simplex (complete graph) if and only if G is connected and contains no isometric rays and no infinite simplices. © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 99–109, 1998
Keywords:infinite graphs  isometric ray  chordal graph  fixed-point theorem
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号