Show simple item record

dc.contributor.authorBarrière Figueroa, Eulalia
dc.contributor.authorComellas Padró, Francesc de Paula
dc.contributor.authorDalfó Simó, Cristina
dc.contributor.authorFiol Mora, Miquel Àngel
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned2007-03-13T17:46:45Z
dc.date.available2007-03-13T17:46:45Z
dc.date.issued2007
dc.identifier.urihttp://hdl.handle.net/2117/672
dc.description.abstractA new operation on graphs is introduced and some of its properties are studied. We call it hierarchical product, because of the strong (connectedness) hierarchy of the vertices in the resulting graphs. In fact, the obtained graphs turn out to be subgraphs of the cartesian product of the corresponding factors. Some well-known properties of the cartesian product, such as a reduced mean distance and diameter, simple routing algorithms and some optimal communication protocols are inherited by the hierarchical product. We also address the study of some algebraic properties of the hierarchical product of two or more graphs. In particular, the spectrum of the binary hypertree $T_m$ (which is the hierarchical product of several copies of the complete graph on two vertices) is fully characterized; turning out to be an interesting example of graph with all its eigenvalues distinct. Finally, some natural generalizations of the hierarchic product are proposed.
dc.language.isoeng
dc.rightsAttribution-NoDerivs 2.5 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nd/2.5/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject.lcshRepresentations of graphs
dc.subject.otherGraph operation
dc.subject.otherHierarchical product
dc.subject.otherDiameter
dc.subject.otherMean distance
dc.subject.otherAdjacency matrix
dc.subject.otherEigenvalues
dc.subject.otherCharacteristic polynomial
dc.titleThe hierarchical product of graphs
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.subject.amsClassificació AMS::05 Combinatorics::05C Graph theory
dc.rights.accessOpen Access
dc.relation.projectidcttMTM2005-08990-C02-01
dc.relation.projectidcttTEC2005-03575


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NoDerivs 2.5 Spain