QQ客服 官方微博 反馈留言

	Vertex Weighted Complexities of Graph Coverings
	Wu, Hongfeng ; Feng, Rongquan ; Sato, Iwao
	2011
关键词	complexity graph covering Laplacian matrix
英文摘要	In this paper the vertex weighted complexity of a graph is considered. A generalization of Northshield's Theorem for the vertex weighted complexity of a graph is presented. Furthermore, an explicit formula for the vertex weighted complexity of a covering graph of G in terms of that of G is given.; Mathematics, Applied; Mathematics; SCI(E); 中国科学引文数据库(CSCD); 1; ARTICLE; 1; 129-138; 18
语种	英语
出处	SCI
出版者	algebra colloquium
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/314459]
专题	数学科学学院
推荐引用方式 GB/T 7714	Wu, Hongfeng,Feng, Rongquan,Sato, Iwao. Vertex Weighted Complexities of Graph Coverings. 2011-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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