No Detail Found!

Radio number for prism related graphs Dn*.

Author(s)
Saima Nazeer Department of Mathematics, Lahore College for Women University, Lahore, Pakistan
Imrana Kousar Department of Mathematics, Lahore College for Women University, Lahore, Pakistan
Waqas Nazeer Department of Mathematics, Lahore Leads University, Lahore, Pakistan
Abstract
For a connected graph G , let d(x, y) denote the distance between any two vertices in G , which is the length of the shortest path between them. The diameter of G is the maximum distance between any pair of vertices of G denoted by diam (G). A radio labeling of G is an assignment of positive integer to the vertices of G such that for any vertices x and y the following inequality f (x) − f (y) |≥ diam(G) − d(x, y) +1 holds. The span of a radio labeling is the maximum integer assigned to a vertex. The radio number of a graph G is the minimum span taken over all radio labelings of G . In this paper, we determine the radio number for the prism related graphs, n D∗ when n = 4k + 2 .
Publication Details
Page(s) 551-555
DOI DOI not available
Published Journal: Science International, Volume: 26, Issue: 2, Year: 2014

Request the full text from PASTIC

0

Citations

0

Downloads

48

Views