The spectra of a graph obtained from copies of a generalized Bethe tree
β Scribed by Oscar Rojo
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 299 KB
- Volume
- 420
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A generalized Bethe tree is a rooted tree in which vertices at the same distance from the root have the same degree. Let P m be a path of m vertices. Let {B i : 1 i m} be a set of generalized Bethe trees. Let P m {B i : 1 i m} be the tree obtained from P m and the trees B 1 , B 2 , . . . , B m by id
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a graph representation for pattern matching since it is invariant to the labelling of the graph. There are, however, a numbe