Edge-disjoint spanners of complete graphs and complete digraphs

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

doi:10.1016/s0012-365x(99)00012-6

Edge-disjoint spanners of complete graphs and complete digraphs

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

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

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(d_G(u,v)) where da and d_S 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.

Original language	English
Pages (from-to)	133-159
Number of pages	27
Journal	Discrete Mathematics
Volume	203
Issue number	1-3
DOIs	https://doi.org/10.1016/s0012-365x(99)00012-6
State	Published - 28 May 1999
Externally published	Yes

Keywords

Complete digraph
Complete graph
Delay
Graph spanner

Access to Document

10.1016/s0012-365x(99)00012-6

Cite this

@article{1387c3f3d347421a933d80b8036ca1c1,

title = "Edge-disjoint spanners of complete graphs and complete digraphs",

abstract = "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 da 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.",

keywords = "Complete digraph, Complete graph, Delay, Graph spanner",

author = "Christian Laforest and Liestman, \{Arthur L.\} and David Peleg and Shermer, \{Thomas C.\} and Dominique Sotteau",

year = "1999",

month = may,

day = "28",

doi = "10.1016/s0012-365x(99)00012-6",

language = "אנגלית",

volume = "203",

pages = "133--159",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Edge-disjoint spanners of complete graphs and complete digraphs

AU - Laforest, Christian

AU - Liestman, Arthur L.

AU - Peleg, David

AU - Shermer, Thomas C.

AU - Sotteau, Dominique

PY - 1999/5/28

Y1 - 1999/5/28

N2 - 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 da 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.

AB - 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 da 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.

KW - Complete digraph

KW - Complete graph

KW - Delay

KW - Graph spanner

UR - https://www.scopus.com/pages/publications/0347092416

U2 - 10.1016/s0012-365x(99)00012-6

DO - 10.1016/s0012-365x(99)00012-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0347092416

SN - 0012-365X

VL - 203

SP - 133

EP - 159

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Edge-disjoint spanners of complete graphs and complete digraphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this