QQ客服 官方微博 反馈留言

	The inverse of the distance matrix of a distance well-defined graph
	Zhou, Hui
	2017
关键词	Distance well-defined graph Distance matrix Laplacian-like matrix Laplacian expressible matrix Generalized distance matrix Inverse TREE
英文摘要	A square matrix L is called a Laplacian-like matrix if Lj = 0 and j(T) L = 0. A square matrix D is left (or right) Laplacian expressible if there exist a number lambda not equal 0, a column vector beta satisfying beta(T)j = 1, and a square matrix L such that beta(T) D = lambda j(T), LD + I = beta j(T) and Lj = 0 (or D beta = lambda j, DL + I = j beta(T) and j(T) L = 0). We consider the generalized distance matrix D (see Definition 4.1) of a graph whose blocks correspond to left (or right) Laplacian expressible matrices. Then D is also left (or right) Laplacian expressible, and the inverse D-1, when it exists, can be expressed as the sum of a Laplacian-like matrix and a rank one matrix. (C) 2016 Elsevier Inc. All rights reserved.; SCI(E); ARTICLE; 11-29; 517
语种	英语
出处	SCI
出版者	LINEAR ALGEBRA AND ITS APPLICATIONS
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/474588]
专题	数学科学学院
推荐引用方式 GB/T 7714	Zhou, Hui. The inverse of the distance matrix of a distance well-defined graph. 2017-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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