<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-17T14:04:30Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/1187" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/1187</identifier><datestamp>2025-07-17T13:30:01Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>On the Hierarchical Product of Graphs and the Generalized Binomial Tree</dc:title>
   <dc:creator>Barrière Figueroa, Eulalia</dc:creator>
   <dc:creator>Comellas Padró, Francesc de Paula</dc:creator>
   <dc:creator>Dalfó Simó, Cristina</dc:creator>
   <dc:creator>Fiol Mora, Miquel Àngel</dc:creator>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions</dc:contributor>
   <dc:subject>Graph theory</dc:subject>
   <dc:subject>Binomial tree</dc:subject>
   <dc:subject>Hierarchical product</dc:subject>
   <dc:subject>Adjacency matrix</dc:subject>
   <dc:subject>Eignvalues</dc:subject>
   <dc:subject>Eigenvectors</dc:subject>
   <dc:subject>Grafs, Teoria de</dc:subject>
   <dc:subject>Classificació AMS::05 Combinatorics::05C Graph theory</dc:subject>
   <dc:description>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&#xd;
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:description>
   <dc:date>2007-09</dc:date>
   <dc:type>Article</dc:type>
   <dc:identifier>https://hdl.handle.net/2117/1187</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/2.5/es/</dc:rights>
   <dc:rights>Open Access</dc:rights>
   <dc:rights>Attribution-NonCommercial-NoDerivs 2.5 Spain</dc:rights>
   <dc:format>17</dc:format>
   <dc:format>application/pdf</dc:format>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>