METRIC CHARACTERIZATION OF PARITY GRAPHS

被引：4

作者：

BANDELT, HJ ^{[1
]}

MULDER, HM ^{[1
]}

机构：

[1] ERASMUS UNIV,INST ECONOMETRISCH,3000 DR ROTTERDAM,NETHERLANDS

来源：

DISCRETE MATHEMATICS | 1991年 / 91卷 / 03期

关键词：

D O I：

10.1016/0012-365X(90)90231-6

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A parity graph is a graph in which any two induced paths joining the same pair of vertices have the same parity. We characterize parity graphs via forbidden isometric subgraphs and, moreover, solely in terms of the distance function d.

引用

页码：221 / 230

页数：10

共 7 条

[1] DISTANCE-HEREDITARY GRAPHS [J].

BANDELT, HJ ;

MULDER, HM .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 41 (02) :182-208

[2]

BURLET M, 1982, ANN DISCRETE MATH, V16, P1

[3] ON LOCAL CONVEXITY IN GRAPHS [J].

FARBER, M ;

JAMISON, RE .

DISCRETE MATHEMATICS, 1987, 66 (03) :231-247

[4] BRIDGED GRAPHS AND GEODESIC CONVEXITY [J].

FARBER, M .

DISCRETE MATHEMATICS, 1987, 66 (03) :249-257

[5] CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS [J].

HOWORKA, E .

QUARTERLY JOURNAL OF MATHEMATICS, 1977, 28 (112) :417-420

[6] METRIC PROPERTIES OF CERTAIN CLIQUE GRAPHS [J].

HOWORKA, E .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 27 (01) :67-74

[7]

SOLTAN VP, 1983, KIBERNETIKA, V6, P14

← 1 →