No starlike trees are cospectral

被引：45

作者：

Lepovic, M ^{[1
]}

Gutman, I ^{[1
]}

机构：

[1] Univ Kragujevac, Fac Sci, YU-34000 Kragujevac, Yugoslavia

来源：

DISCRETE MATHEMATICS | 2002年 / 242卷 / 1-3期

关键词：

starlike tree; spectrum (of graph); cospectral graphs;

D O I：

10.1016/S0012-365X(01)00169-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A tree is said to be starlike if exactly one of its vertices has degree greater than two. We show that no two non-isomorphic starlike trees are cospectral. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：291 / 295

页数：5

共 7 条

[1]

Bell FK, 1998, MATH APPL, V430, P433

[2]

Cvetkovic D., 1995, Spectra of Graphs-Theory and Application, V3rd ed.

[3] Matchings in starlike trees [J].

Gutman, I ;

Araujo, O ;

Rada, J .

APPLIED MATHEMATICS LETTERS, 2001, 14 (07) :843-848

[4]

RADA J, IN PRESS DISCRETE AP

[5]

Schwenk A. J., 1974, GRAPH COMBINATOR, P153

[6]

SCHWENK AJ, 1973, NEW DIRECTIONS THEOR, P275

[7]

Watanabe M., 1979, Journal of the Australian Mathematical Society, Series A (Pure Mathematics), V28, P120

← 1 →