The knowledge of the spectrum of a (di)graph is relevant for estimating some of its structural properties, which provide information on the topological and communication properties of the… (More)

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,… (More)

The two main characteristics of small-world networks are strong local clustering, and small diameter. These two characteristics are desirable properties in communication networks since typical… (More)

This paper addresses the minimum-time broadcast problem under several modes of the line model, i.e., when long-distance calls can be placed along paths in the network. It is well known that the… (More)

The multidimensional Manhattan street networks constitute a family of digraphs with many interesting properties, such as vertex symmetry (in fact they are Cayley digraphs), easy routing,… (More)

We consider the problem of routing uniform communication instances in switched optical tori that use the wavelength division multi-plexing (or WDM) approach. A communication instance is called… (More)

A Polyomino is an edge–connected union of cells in the planar square lattice. Here we consider generalized linear polyominoes; that is, the polyominoes supported by a n × 2 lattice. In this paper, we… (More)

We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The… (More)