SMITH NORMAL FORMAL OF DISTANCE MATRIX OF BLOCK GRAPHS |
| |
Authors: | Jing Chen and Yaoping Hou |
| |
Affiliation: | The center of discrete mathematics, Fuzhou University, Fujian 350003, PR China and School of Mathematics, Hunan First Normal University, Hunan 410205, PR of China |
| |
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. |
| |
Keywords: | block graph distance matrix Smith normal form |
本文献已被 CNKI 等数据库收录! |
| 点击此处可从《应用数学年刊》浏览原始摘要信息 |
|
点击此处可从《应用数学年刊》下载免费的PDF全文 |
|