Loading...
Please wait, while we are loading the content...
Similar Documents
L(j, k)-labeling Number of Cactus Graph
| Content Provider | Scilit |
|---|---|
| Author | Wu, Qiong |
| Copyright Year | 2018 |
| Description | Journal: Iop Conference Series: Materials Science and Engineering For j ≤ k, the L(j,k) -labelling problem arose from code assignment problem of computer wireless networks. That is, let j, k and m be positive numbers, an m-L(j, k) -labelling of a graph G is a mapping f: V(G) → [0, m] such that | f (u) - f (v) |≥ j if d (u, v) = 1, and | f (u) - f (v) |≥ k if d (u,v) = 2. The span of f is the difference between the maximum and the minimum numbers assigned by f. The L(j, k) -labelling number of G, denoted by $λ_{jk}$ (G), is the minimum span over all L( j, k)-labellings of G. In this paper, we introduce the L(j, k )- labelling numbers of Cactus graph for any positive real numbers j, k with j ≤ k. |
| Related Links | http://iopscience.iop.org/article/10.1088/1757-899X/466/1/012082/pdf |
| ISSN | 17578981 |
| e-ISSN | 1757899X |
| DOI | 10.1088/1757-899x/466/1/012082 |
| Journal | Iop Conference Series: Materials Science and Engineering |
| Issue Number | 1 |
| Volume Number | 466 |
| Language | English |
| Publisher | IOP Publishing |
| Publisher Date | 2018-12-28 |
| Access Restriction | Open |
| Subject Keyword | Journal: Iop Conference Series: Materials Science and Engineering Hardware and Architecture Cactus Graph Labeling Number Numbers of Cactus |
| Content Type | Text |
| Resource Type | Article |
