Loading...
Loading...

Go to the content (press return)

A note on a new general family of deterministic hierarchical networks

Author
Dalfo, C.; Fiol, M.
Type of activity
Journal article
Journal
Journal of interconnection networks
Date of publication
2019-06-01
Volume
19
Number
2
First page
1
Last page
13
DOI
10.1142/S0219265919500051
Project funding
2017SGR1087 - Combinatòria, Teoria de Grafs i Aplicacions
Production optimization in hybrid workshops linked by units in sequence
Repository
http://hdl.handle.net/2117/167364 Open in new window
URL
https://www.worldscientific.com/doi/abs/10.1142/S0219265919500051 Open in new window
Abstract
Hierarchical network; Small-word; Scale-free; Routing algorithm; Diameter; Clustering
Citation
Dalfo, C.; Fiol, M. A note on a new general family of deterministic hierarchical networks. "Journal of interconnection networks", 1 Juny 2019, vol. 19, núm. 2, p. 1-13.
Keywords
It is known that many networks modeling real-life complex systems are small-word (large local clustering and small diameter) and scale-free (power law of the degree distribution), an efficient shortest-path local algorithm is proposed., and the edges are defined by a specific rule relating different words). This allows us the characterization of their main distance-related parameters, and very often they are also hierarchical. Although most of the models are based on stochastic methods, as a by-product, because this allows a better computation of their properties. Here a new deterministic family of hierarchical networks is presented, some deterministic constructions have been recently proposed, such as the radius and diameter. Moreover, such as the so-called binomial tree. The obtained graphs can be seen as graphs on alphabets (where vertices are labeled with words of a given alphabet, which generalizes most of the previous proposals
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments