In this paper, we establish the maximum number of basic shortest paths in Cartesian product graphs and bounds on the maximum number of the vertex-disjoint sh...

Any telecommunication network is subject to a node or link failure at any given time. Such a failure may impact the quality of the services provided by the n...

Considering a graph as a network of resistances, Klein and Randić (1993) proposed the definition of a distance measure. Indeed, if each edge of the graph re...

Trends in wireless networks are proceeding toward increasingly dense deployments, supporting resilient interconnection for applications that carry ever highe...

In this paper, we summarize some properties of the Cartesian product of graphs related to degree and distance-based invariants. Then, we investigate how mu...

In this paper we propose the use of twin graphs for optical transport network (OTN) physical topology design. Some properties inherent to twin graphs are fa...

This paper presents a decomposition approach for solving a variant of the Routing and Wavelength Assignment (RWA) problem, in which all connection requests a...

In this paper, we present an edge and vertex decomposition of the Wiener index (<i>W</i>) that is related to the concept of betweenness centrality used in so...