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.
Original language | English |
---|---|
Pages (from-to) | 349-362 |
Number of pages | 14 |
Journal | Discrete Applied Mathematics |
Volume | 136 |
Issue number | 2-3 |
DOIs | |
State | Published - 15 Feb 2004 |
Event | 1st Cologne-Twente Workshop on Graphs and Combinatorial (CTW 2001) - Enschede, Netherlands Duration: 6 Jun 2001 → 8 Jun 2001 |
Keywords
- Characteristic polynomial
- Diameter
- Integral tree