Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAndrade, Enidept
dc.contributor.authorCardoso, Domingos
dc.contributor.authorMedina, Luispt
dc.contributor.authorRojo, Oscarpt
dc.description.abstractA weighted Bethe graph $B$ is obtained from a weighted generalized Bethe tree by identifying each set of children with the vertices of a graph belonging to a family $F$ of graphs. The operation of identifying the root vertex of each of $r$ weighted Bethe graphs to the vertices of a connected graph $\mathcal{R}$ of order $r$ is introduced as the $\mathcal{R}$-concatenation of a family of $r$ weighted Bethe graphs. It is shown that the Laplacian eigenvalues (when $F$ has arbitrary graphs) as well as the signless Laplacian and adjacency eigenvalues (when the graphs in $F$ are all regular) of the $\mathcal{R}$-concatenation of a family of weighted Bethe graphs can be computed (in a unified way) using the stable and low computational cost methods available for the determination of the eigenvalues of symmetric tridiagonal matrices. Unlike the previous results already obtained on this topic, the more general context of families of distinct weighted Bethe graphs is herein
dc.publisherTaylor & Francispt
dc.relationProject Fondecyt Regular 1130135pt
dc.subjectGraph spectrapt
dc.subjectGraph operationspt
dc.subjectLaplacian matrixpt
dc.subjectSignless Laplacian matrixpt
dc.subjectAdjacency matrixpt
dc.titleBethe graphs attached to the vertices of a connected graph: a spectral approachpt
degois.publication.titleLinear and Multilinear Algebrapt
Appears in Collections:CIDMA - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
BetheGraphsAttachedR.pdfDocumento principal332.25 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.