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


On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs
Authors:Marc Chastand
Institution:I.A.E., Université Jean Moulin (Lyon 3), 6 cours Albert Thomas, 69355 Lyon Cedex 08, France
Abstract:We prove that the non-trivial (finite or infinite) weakly median graphs which are undecomposable with respect to gated amalgamation and Cartesian multiplication are the 5-wheels, the subhyperoctahedra different from K1, the path K1,2 and the 4-cycle K2,2, and the two-connected K4- and K1,1,3-free bridged graphs. These prime graphs are exactly the weakly median graphs which do not have any proper gated subgraphs other than singletons. For finite graphs, these results were already proved in H.-J. Bandelt, V.C. Chepoi, The algebra of metric betweenness I: subdirect representation, retracts, and axiomatics of weakly median graphs, preprint, 2002]. A graph G is said to have the half-space copoint property (HSCP) if every non-trivial half-space of the geodesic convexity of G is a copoint at each of its neighbors. It turns out that any median graph has the HSCP. We characterize the weakly median graphs having the HSCP. We prove that the class of these graphs is closed under gated amalgamation and Cartesian multiplication, and we describe the prime and the finite regular elements of this class.
Keywords:Infinite graph  Weakly median graph  Octahedral graph  Geodesic convexity  Gated set  Cartesian product  Gated amalgam  Prime graph
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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