ON ULAMS CONJECTURE FOR SEPARABLE GRAPHS

被引：27

作者：

BONDY, JA

机构：

[1] University of Waterloo, Waterloo, ON

来源：

PACIFIC JOURNAL OF MATHEMATICS | 1969年 / 31卷 / 02期

关键词：

D O I：

10.2140/pjm.1969.31.281

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Ulam’s conjecture, that every graph of order greater than two is determined up to isomorphism by its collection of maximal subgraphs, is verified for the case of separable graphs which have no pendant vertices. Partial results are then obtained for the case of graphs with pendant vertices. © 1969 by Pacific Journal of Mathematics.

引用

页码：281 / &

共 8 条

[1]

BERGE C, 1958, THEORY GRAPHS

[2]

BONDY JA, 1969, PROC CAMB PHILOS S-M, V65, P387

[3]

GREENWELL DL, RECONSTRUCTING GRAPH

[4] ON PROBLEM OF RECONSTRUCTING A TOURNAMENT FROM SUBTOURNAMENTS [J].

HARARY, F ;

PALMER, E .

MONATSHEFTE FUR MATHEMATIK, 1967, 71 (01) :14-+

[5] RECONSTRUCTION OF A TREE FROM ITS MAXIMAL SUBTREES [J].

HARARY, F ;

PALMER, E .

CANADIAN JOURNAL OF MATHEMATICS, 1966, 18 (04) :803-&

[6]

Harary F, 1963, P S SMOLENICE, P47

[7]

Kelly P.J, 1957, PAC J MATH, V7, P961

[8]

[No title captured]

← 1 →