Families of integral trees with diameters 4, 6, and 8

Ligong Wang; Xueliang Li; Shenggui Zhang

doi:10.1016/S0166-218X(03)00450-5

Families of integral trees with diameters 4, 6, and 8

Ligong Wang
, Xueliang Li
, Shenggui Zhang

数学与统计学院

Nankai University
Xi'an Jiaotong University

科研成果: 期刊稿件 › 会议文章 › 同行评审

16 引用（Scopus）

摘要

The families of integral trees with 4, 6, 8 diameters were discussed. Most of these classes were infinite. Considering for a Graph G, V(G) denotes the vertex set of G and E(G) denotes the edge set various proofs were obtained. The construction of integral trees by identifying the centers of two trees was also elaborated.

源语言	英语
页（从-至）	349-362
页数	14
期刊	Discrete Applied Mathematics
卷	136
期	2-3
DOI	https://doi.org/10.1016/S0166-218X(03)00450-5
出版状态	已出版 - 15 2月 2004
活动	1st Cologne-Twente Workshop on Graphs and Combinatorial (CTW 2001) - Enschede, 荷兰期限: 6 6月 2001 → 8 6月 2001

访问文件

10.1016/S0166-218X(03)00450-5

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{ebb984da2f514c79b21854c40ceb38ba,

title = "Families of integral trees with diameters 4, 6, and 8",

abstract = "The families of integral trees with 4, 6, 8 diameters were discussed. Most of these classes were infinite. Considering for a Graph G, V(G) denotes the vertex set of G and E(G) denotes the edge set various proofs were obtained. The construction of integral trees by identifying the centers of two trees was also elaborated.",

keywords = "Characteristic polynomial, Diameter, Integral tree",

author = "Ligong Wang and Xueliang Li and Shenggui Zhang",

year = "2004",

month = feb,

day = "15",

doi = "10.1016/S0166-218X(03)00450-5",

language = "英语",

volume = "136",

pages = "349--362",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "2-3",

note = "1st Cologne-Twente Workshop on Graphs and Combinatorial (CTW 2001) ; Conference date: 06-06-2001 Through 08-06-2001",

}

TY - JOUR

T1 - Families of integral trees with diameters 4, 6, and 8

AU - Wang, Ligong

AU - Li, Xueliang

AU - Zhang, Shenggui

PY - 2004/2/15

Y1 - 2004/2/15

N2 - The families of integral trees with 4, 6, 8 diameters were discussed. Most of these classes were infinite. Considering for a Graph G, V(G) denotes the vertex set of G and E(G) denotes the edge set various proofs were obtained. The construction of integral trees by identifying the centers of two trees was also elaborated.

AB - The families of integral trees with 4, 6, 8 diameters were discussed. Most of these classes were infinite. Considering for a Graph G, V(G) denotes the vertex set of G and E(G) denotes the edge set various proofs were obtained. The construction of integral trees by identifying the centers of two trees was also elaborated.

KW - Characteristic polynomial

KW - Diameter

KW - Integral tree

UR - https://www.scopus.com/pages/publications/0346686364

U2 - 10.1016/S0166-218X(03)00450-5

DO - 10.1016/S0166-218X(03)00450-5

M3 - 会议文章

AN - SCOPUS:0346686364

SN - 0166-218X

VL - 136

SP - 349

EP - 362

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 2-3

T2 - 1st Cologne-Twente Workshop on Graphs and Combinatorial (CTW 2001)

Y2 - 6 June 2001 through 8 June 2001

ER -