Smith Normal Form of Distance Matrix of Block Graphs

Smith Normal Form of Distance Matrix of Block Graphs

Year:    2016

Author:    Jing Chen, Yaoping Hou

Annals of Applied Mathematics, Vol. 32 (2016), Iss. 1 : pp. 20–29

Abstract

A connected graph, whose blocks are all cliques (of possibly varying sizes), is called a block graph. Let $D(G)$ be its distance matrix. In this note, we prove that the Smith normal form of $D(G)$ is independent of the interconnection way of blocks and give an explicit expression for the Smith normal form in the case that all cliques have the same size, which generalize the results on determinants.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/2016-AAM-20624

Annals of Applied Mathematics, Vol. 32 (2016), Iss. 1 : pp. 20–29

Published online:    2016-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    10

Keywords:    block graph distance matrix Smith normal form.

Author Details

Jing Chen

Yaoping Hou