Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.dam.2007.10.018 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Distance,Median,Isometric,Embedding | Block graph,Discrete mathematics,Combinatorics,Vertex-transitive graph,Line graph,Graph factorization,Distance-hereditary graph,Factor-critical graph,Universal graph,Mathematics,Degeneracy (graph theory) | Journal |
Volume | Issue | ISSN |
156 | 12 | 0166-218X |
Citations | PageRank | References |
3 | 0.48 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Dankelmann | 1 | 91 | 11.41 |
| G. Sabidussi | 2 | 8 | 2.32 |