On the Hierarchical Product of Graphs and the Generalized Binomial Tree

dc.contributor
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor
Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author
Barrière Figueroa, Eulalia
dc.contributor.author
Comellas Padró, Francesc de Paula
dc.contributor.author
Dalfó Simó, Cristina
dc.contributor.author
Fiol Mora, Miquel Àngel
dc.date.issued
2007-09
dc.identifier
https://hdl.handle.net/2117/1187
dc.description.abstract
In this paper we follow the study of the hierarchical product of graphs, an operation recently introduced in the context of networks. A well-known example of such a product is the binomial tree which is the (hierarchical) power of the complete graph on two vertices. An appealing property of this structure is that all the eigenvalues are distinct. Here we show how to obtain a graph with this property by applying the hierarchical product. In particular, we propose a generalization of the binomial tree and some of its main properties are studied.
dc.format
17
dc.format
application/pdf
dc.language
eng
dc.rights
http://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.rights
Open Access
dc.rights
Attribution-NonCommercial-NoDerivs 2.5 Spain
dc.subject
Graph theory
dc.subject
Binomial tree
dc.subject
Hierarchical product
dc.subject
Adjacency matrix
dc.subject
Eignvalues
dc.subject
Eigenvectors
dc.subject
Grafs, Teoria de
dc.subject
Classificació AMS::05 Combinatorics::05C Graph theory
dc.title
On the Hierarchical Product of Graphs and the Generalized Binomial Tree
dc.type
Article


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

E-prints [73046]