Spectral property of certain class of graphs associated with generalized bethe trees and transitive graphs

4Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

A generalized Bethe tree is a rooted tree for which the vertices in each level having equal degree. Let Bk be a generalized Bethe tree of k level, and let Tr be a connected transitive graph on r vertices. Then we obtain a graph Bk o Tr from r copies of Bk and Tr by appending r roots to the vertices of Tr respectively. In this paper, we give a simple way to characterize the eigenvalues of the adjacency matrix A(Bk o Tr) and the Laplacian matrix L(BkoTr) ofBk o Tr by means of symmetric tridiagonal matrices of order k. We also present some structure properties of the Perron vectors of A(Bk o Tr) and the Fiedler vectors of L(Bk o Tr). In addition, we obtain some results on transitive graphs.

Cite

CITATION STYLE

APA

Fan, Y. Z., Li, S. D., & Liang, D. (2008). Spectral property of certain class of graphs associated with generalized bethe trees and transitive graphs. Applicable Analysis and Discrete Mathematics, 2(2), 260–275. https://doi.org/10.2298/AADM0802260F

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free