In this work we introduce, characterize, and provide algorithmic results for (k, +)-distance-hereditary graphs. These graphs can be used to model interconnection networks with desirable connectivity properties; a network modeled as a (k, +)-distance-hereditary graph can be characterized as follows: if some nodes have failed, as long as two nodes remain connected, the distance between these nodes in the faulty graph is bounded by k plus the distance in the non-faulty graph. The class of all these graphs is denoted by DH(k, +) By varying the parameter k, classes DH(k, +) form a hierarchy that represents a parametric extension of the well-known class of distance-hereditary graphs, and include all graphs.

(k,+)-distance hereditary graphs (extended abstract)

CICERONE, SERAFINO;DI STEFANO, GABRIELE
2001-01-01

Abstract

In this work we introduce, characterize, and provide algorithmic results for (k, +)-distance-hereditary graphs. These graphs can be used to model interconnection networks with desirable connectivity properties; a network modeled as a (k, +)-distance-hereditary graph can be characterized as follows: if some nodes have failed, as long as two nodes remain connected, the distance between these nodes in the faulty graph is bounded by k plus the distance in the non-faulty graph. The class of all these graphs is denoted by DH(k, +) By varying the parameter k, classes DH(k, +) form a hierarchy that represents a parametric extension of the well-known class of distance-hereditary graphs, and include all graphs.
2001
3-540-42707-4
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11697/40100
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? ND
social impact