The generalized hierarchical product of graphs
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/1927
Tipus de documentArticle
Data publicació2008-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 2.5 Espanya
Abstract
A generalization of both the hierarchical product and the Cartesian
product of graphs is introduced and some of its properties are
studied. We call it the generalized hierarchical product. In fact,
the obtained graphs turn out to be subgraphs of the Cartesian
product of the corresponding factors. Thus, some well-known
properties of this product, such as a good connectivity, reduced
mean distance, radius and diameter, simple routing algorithms and
some optimal communication protocols, are inherited by the
generalized hierarchical product. Besides some of these properties,
in this paper we study the spectrum, the existence of Hamiltonian
cycles, the chromatic number and index, and the connectivity of the
generalized hierarchical product.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Gen_hierarchical(27mar).pdf | 281,2Kb | Visualitza/Obre |