Distance-balanced graphs

被引：72

作者：

Jerebic, Janja ^{[1
]}

Klavzar, Sandi ^{[1
]}

Rall, Douglas F. ^{[2
]}

机构：

[1] Univ Maribor, Dept Math & Comp Sci, FNM, SLO-2000 Maribor, Slovenia

[2] Furman Univ, Dept Math, Greenville, SC 29613 USA

来源：

ANNALS OF COMBINATORICS | 2008年 / 12卷 / 01期

关键词：

graph distance; distance-balanced graphs; graph products; connectivity;

D O I：

10.1007/s00026-008-0337-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: The number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. The new concept is connected with symmetry conditions in graphs and local operations on graphs are studied with respect to it. Distance-balanced Cartesian and lexicographic products of graphs are also characterized. Several open problems are posed along the way.

引用

页码：71 / 79

页数：9

共 13 条

[1]

Ashrafi AR, 2006, ARS COMBINATORIA, V80, P193

[2]

Bandelt HJ, 2008, CONTEMP MATH, V453, P49

[3] ISOMETRIC SUBGRAPHS OF HAMMING GRAPHS AND D-CONVEXITY [J].

CHEPOI, VD .

CYBERNETICS, 1988, 24 (01) :6-11

[4]

Djokovic D. ., 1973, J COMB THEORY B, V14, P263, DOI [DOI 10.1016/0095-8956(73)90010-5, 10.1016/0095-8956(73)90010-5]

[5] GROUPS OF GENERALIZED PETERSEN GRAPHS [J].

FRUCHT, R ;

GRAVER, JE ;

WATKINS, ME .

PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY-MATHEMATICAL AND PHYSICAL SCIENCES, 1971, 70 (SEP) :211-&

[6] ANTIPODAL GRAPHS AND ORIENTED MATROIDS [J].

FUKUDA, K ;

HANDA, K .

DISCRETE MATHEMATICS, 1993, 111 (1-3) :245-256

[7]

Graovac A, 2003, MATCH-COMMUN MATH CO, P47

[8]

Gutman I., 1998, GRAPH THEORY NOTES N, V34, P37

[9]

Handa K, 1999, ARS COMBINATORIA, V51, P113

[10]

IMRICH W, 2000, WIL INT S D, pR13

← 1 2 →