QQ客服 官方微博 反馈留言

	On top locally-s-distance-transitive graphs
	Zhou, Hui
	2017
关键词	Top Locally-s-distance-transitive graph Normal quotient Normal multicover SYMMETRIC GRAPHS
英文摘要	A graph with some graph symmetry property is top, if it cannot be viewed as a nontrivial normal quotient of some other graph with the same graph symmetry property. Therefore, a graph being top implies that it has no nontrivial normal multicovers, including normal covers. John Conway proved that every s-arc-transitive graph has a nontrivial s-arc transitive normal cover, so there is no top s-arc-transitive graph. However, there exist top locally-s-distance-transitive graphs, and complete multipartite graphs are examples of this. In this paper, we give a generic condition for locally-s-distance-transitive graphs to be top. Also, examples and characterizations of graphs that admit this condition are given. (C) 2017 Elsevier B.V. All rights reserved.; SCI(E); ARTICLE; 8; 1773-1783; 340
语种	英语
出处	SCI
出版者	DISCRETE MATHEMATICS
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/471974]
专题	数学科学学院
推荐引用方式 GB/T 7714	Zhou, Hui. On top locally-s-distance-transitive graphs. 2017-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。