L(2,1)-Labeling for Subdivisions of Cycle Dominated Graphs
Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of non-negative integers such that |f(x)-f(y)| >= 2 if x and y are adjacent and |f(x)-f(y)| >= 1 if x and y are at distance...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad Simón Bolívar
2015-01-01
|
| Series: | Bulletin of Computational Applied Mathematics |
| Subjects: | |
| Online Access: | http://drive.google.com/open?id=0B5GyVVQ6O030cWRXLWMyMnRRMnM |