### Abstract

In [4] Fan Chung Graham investigates notion of graph labelings and related bandwidth and cutwidth of such labelings when the host graph is a path graph. Motivated by problems presented in [4] and our investigation of designing efficient virtual path layouts for communication networks, we investigate in this note labeling methods on graphs where the host graph is not restricted to a particular kind of graph. In [2] authors introduced a metric on the set of connected simple graphs of a given order which represents load on edges of host graph under some restrictions on bandwidth of such labelings. In communication networks this translates into finding mappings between guest graph and host graph in a way that minimizes the congestion while restricting the delay. In this note, we present optimal mappings between special n-vertex graphs in G _{n} and compute their distances with respect to the metric introduced in [2]. Some open questions are also presented.

Original language | English (US) |
---|---|

Pages (from-to) | 45-52 |

Number of pages | 8 |

Journal | Ars Combinatoria |

Volume | 77 |

State | Published - Oct 1 2005 |

### Fingerprint

### Keywords

- Distance between graphs
- Graph embeddings
- Virtual path layout

### ASJC Scopus subject areas

- Mathematics(all)

### Cite this

*Ars Combinatoria*,

*77*, 45-52.

**Distance between graphs using graph labelings.** / Bhutani, Kiran R.; Khan, Bilal.

Research output: Contribution to journal › Article

*Ars Combinatoria*, vol. 77, pp. 45-52.

}

TY - JOUR

T1 - Distance between graphs using graph labelings

AU - Bhutani, Kiran R.

AU - Khan, Bilal

PY - 2005/10/1

Y1 - 2005/10/1

N2 - In [4] Fan Chung Graham investigates notion of graph labelings and related bandwidth and cutwidth of such labelings when the host graph is a path graph. Motivated by problems presented in [4] and our investigation of designing efficient virtual path layouts for communication networks, we investigate in this note labeling methods on graphs where the host graph is not restricted to a particular kind of graph. In [2] authors introduced a metric on the set of connected simple graphs of a given order which represents load on edges of host graph under some restrictions on bandwidth of such labelings. In communication networks this translates into finding mappings between guest graph and host graph in a way that minimizes the congestion while restricting the delay. In this note, we present optimal mappings between special n-vertex graphs in G n and compute their distances with respect to the metric introduced in [2]. Some open questions are also presented.

AB - In [4] Fan Chung Graham investigates notion of graph labelings and related bandwidth and cutwidth of such labelings when the host graph is a path graph. Motivated by problems presented in [4] and our investigation of designing efficient virtual path layouts for communication networks, we investigate in this note labeling methods on graphs where the host graph is not restricted to a particular kind of graph. In [2] authors introduced a metric on the set of connected simple graphs of a given order which represents load on edges of host graph under some restrictions on bandwidth of such labelings. In communication networks this translates into finding mappings between guest graph and host graph in a way that minimizes the congestion while restricting the delay. In this note, we present optimal mappings between special n-vertex graphs in G n and compute their distances with respect to the metric introduced in [2]. Some open questions are also presented.

KW - Distance between graphs

KW - Graph embeddings

KW - Virtual path layout

UR - http://www.scopus.com/inward/record.url?scp=33644700151&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33644700151&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33644700151

VL - 77

SP - 45

EP - 52

JO - Ars Combinatoria

JF - Ars Combinatoria

SN - 0381-7032

ER -