Embedding graphs as isometric medians

P. Dankelmann; G. Sabidussi

doi:10.1016/j.dam.2007.10.018

Embedding graphs as isometric medians

P. Dankelmann
, G. Sabidussi

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

9 Citations (Scopus)

Abstract

We show that every connected graph can be isometrically (i.e., as a distance preserving subgraph) embedded in some connected graph as its median. As an auxiliary result we also show that every connected graph is an isometric subgraph of some Cayley graph.

Original language	English
Pages (from-to)	2420-2422
Number of pages	3
Journal	Discrete Applied Mathematics
Volume	156
Issue number	12
DOIs	https://doi.org/10.1016/j.dam.2007.10.018
Publication status	Published - 28 Jun 2008
Externally published	Yes

Keywords

Distance
Embedding
Isometric
Median

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2007.10.018

Cite this

@article{b4095a4f6e7c4642b3250a9dd70eeccf,

title = "Embedding graphs as isometric medians",

abstract = "We show that every connected graph can be isometrically (i.e., as a distance preserving subgraph) embedded in some connected graph as its median. As an auxiliary result we also show that every connected graph is an isometric subgraph of some Cayley graph.",

keywords = "Distance, Embedding, Isometric, Median",

author = "P. Dankelmann and G. Sabidussi",

year = "2008",

month = jun,

day = "28",

doi = "10.1016/j.dam.2007.10.018",

language = "English",

volume = "156",

pages = "2420--2422",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "12",

}

TY - JOUR

T1 - Embedding graphs as isometric medians

AU - Dankelmann, P.

AU - Sabidussi, G.

PY - 2008/6/28

Y1 - 2008/6/28

N2 - We show that every connected graph can be isometrically (i.e., as a distance preserving subgraph) embedded in some connected graph as its median. As an auxiliary result we also show that every connected graph is an isometric subgraph of some Cayley graph.

AB - We show that every connected graph can be isometrically (i.e., as a distance preserving subgraph) embedded in some connected graph as its median. As an auxiliary result we also show that every connected graph is an isometric subgraph of some Cayley graph.

KW - Distance

KW - Embedding

KW - Isometric

KW - Median

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

U2 - 10.1016/j.dam.2007.10.018

DO - 10.1016/j.dam.2007.10.018

M3 - Article

AN - SCOPUS:49149120095

SN - 0166-218X

VL - 156

SP - 2420

EP - 2422

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 12

ER -

Embedding graphs as isometric medians

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this