Title of article

Edge-disjoint spanners of complete graphs and complete digraphs Original Research Article

Author/Authors

A spanning subgraph S=(V، نويسنده , , E?) of a connected simple graph (or digraph) G=(V، نويسنده , , E) is an f(x)-spanner if for any pair of vertices u and v، نويسنده , , dS(u، نويسنده , , v)?f(dG(u، نويسنده , , v)) where dG and dS are the usual distance functions in graphs (digraphs) G and S، نويسنده , , respectively. The delay of the f(x)-spanner is f(x)?x. We investigate the number of edge-disjoint spanners of a given delay that can exist in complete graphs and in complete digraphs.، نويسنده ,

Issue Information

روزنامه با شماره پیاپی سال 1999

Pages

From page

133

To page

159

Abstract

Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau

Keywords

Graph spanner , Complete graph , Complete digraph , Delay

Journal title

Discrete Mathematics

Serial Year

1999

Journal title

Discrete Mathematics

Record number

Link To Document