Spiders are status unique in trees

NCU Institutional Repository > 理學院 > 數學系 > 期刊論文 > Item 987654321/51211

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51211

题名:	Spiders are status unique in trees
作者:	Shang,JL;Lin,C
贡献者:	數學系
关键词:	DISTANCE;GRAPHS
日期:	2011
上传时间:	2012-03-27 18:25:05 (UTC+8)
出版者:	國立中央大學
摘要:	The status of a vertex x in a graph is the sum of the distances between x and all other vertices. The status sequence of a graph is the list of the statuses of all vertices arranged in nondecreasing order. It is well known that non-isomorphic trees may have the same status sequence. A graph G is said to be status unique in a family F of graphs if G is a member of F and G is uniquely determined in F by its status sequence. The main result of this paper is that every spider is status unique in the family of all trees. Some conjectures about status unique graphs are proposed at the end of the paper. (C) 2011 Elsevier B.V. All rights reserved.
關聯:	DISCRETE MATHEMATICS
显示于类别:	[數學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	555	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing