ELEMENTARY DIVISORS OF GRAPHS AND MATROIDS

被引：10

作者：

VINCE, A ^{[1
]}

机构：

[1] UNIV FLORIDA,DEPT MATH,GAINESVILLE,FL 32611

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 1991年 / 12卷 / 05期

关键词：

D O I：

10.1016/S0195-6698(13)80020-0

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

New integer invariants of a graph G, introduced by U. Oberst, are obtained as the elementary divisors of the Laplacian matrix of G. The theory of elementary divisors is developed in the context of regular matroids. It is shown that the elementary divisors of a graph are actually invariants of its underlying matroid. Regular matroids, in turn, are related to lattices in euclidean space, and this leads to methods for computing the elementary divisors. Several properties of the elementary divisors of graphs are proved and the problem of how well these invariants distinguish between graphs is addressed. © 1991, Academic Press Limited. All rights reserved.

引用

页码：445 / 453

页数：9

共 8 条

[1]

[Anonymous], 1847, ANN PHYS CHEM, DOI [DOI 10.1002/ANDP.18471481202, 10.1002/andp.18471481202]

[2]

HUNGERFORD TW, 1984, ALGEBRA

[3]

OBERST U, 1987, SEMINAIRE LOTHARINGI

[4]

Schrijver A., 1986, THEORY LINEAR INTEGE

[5]

Tutte William Thomas, 1984, GRAPH THEORY

[6]

Welsh D.J.A., 1976, MATROID THEORY

[7]

White Whi87] Neil, 1987, ENCY MATH ITS APPL, V29, DOI [10.1017/CBO9781107325715, DOI 10.1017/CBO9781107325715]

[8] 2 isomorphic graphs [J].

Whitney, H .

AMERICAN JOURNAL OF MATHEMATICS, 1933, 55 :245-254

← 1 →