Loading...
Loading...

Go to the content (press return)

On the algebraic theory of pseudo-distance-regulariry around a set

Author
Fiol, M.; Garriga, E.
Type of activity
Journal article
Journal
Linear algebra and its applications
Date of publication
1999-09
Volume
298
First page
115
Last page
141
Repository
http://hdl.handle.net/2117/14730 Open in new window
URL
http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0R-3YC0J0W-T&_user=1517299&_coverDate=09%2F01%2F1999&_rdoc=1&_fmt=high&_orig=gateway&_origin=gateway&_sort=d&_docanchor=&view=c&_acct=C000053450&_version=1&_urlVersion=0&_userid=1517299&md5=183617b4ec220701db7392169edaf434&searchtype=a Open in new window
Abstract
Let C be a connected graph with vertex set V, adjacency matrix A, positive eigenvector and corresponding eigenvalue 0. A natural generalization of distance-regularity around a vertex subset C V , which makes sense even with non-regular graphs, is studied. This new concept is called pseudo-distance-regularity, and its definition is based on giving to each vertex u 2 V a weight which equals the corresponding entry u of and “regularizes” the graph. This approach reveals a kind of centra...
Citation
Fiol, M. A.; Garriga, E. On the algebraic theory of pseudo-distance-regulariry around a set. "Linear algebra and its applications", Setembre 1999, vol. 298, p. 115-141.
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants