#### Filter Results:

#### Publication Year

2007

2016

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- Shahid S. Siddiqi, Ghazala Akram, Saima Nazeer
- Applied Mathematics and Computation
- 2007

Let G be a connected graph with diameter diam () G and (,) d x y denotes the shortest distance between any two distinct vertices , xy in G. Radio labeling (multi-level distance labeling or distance labeling) of G is a one-to-one mapping : () {0} f V G Z satisfying (,) | () () | () 1 d x y f x f y diam G for all , () x y V G . The span of a… (More)

- Waqas Nazeer, Shin Min Kang, +4 authors Young Chel Kwun
- Symmetry
- 2016

A vertex v is a peripheral vertex in G if its eccentricity is equal to its diameter, and periphery P(G) is a subgraph of G induced by its peripheral vertices. Further, a vertex v in G is a central vertex if e(v) = rad(G), and the subgraph of G induced by its central vertices is called center C(G) of G. Average eccentricity is the sum of eccentricities of… (More)

- Shin Min Kang, Saima Nazeer, +5 authors A. Rafiq
- 2014

the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract A multilevel distance labeling of the graph G is a function f = (V (G), E(G)) on V (G) of G into N ∪ {0} so that |f (u) − f (v)| ≥ diam(G) + 1 − d(u, v) for all u, v ∈ V (G). The… (More)

- ‹
- 1
- ›