(s, d) Magic Labeling of some ladder graphs
| Autor: | Sumathi P., Mala P. |
|---|---|
| Jazyk: | English<br />French |
| Rok vydání: | 2023 |
| Předmět: | |
| Zdroj: | E3S Web of Conferences, Vol 376, p 01110 (2023) |
| Druh dokumentu: | article |
| ISSN: | 2267-1242 20233760 |
| DOI: | 10.1051/e3sconf/202337601110 |
| Popis: | Let G(p, q) be a connected, undirected, simple and non-trivial graph with q nodes and q lines. Let f be an injective function f: V(G) →{ s, s + d, s + 2d,.....s + (q +1)d } and g be an injective function g: E(G) → {d,2d,3d,… 2(q-1)d}.Then the graph G is said to be (s, d) magic labeling if f(u) + g(uv) + f(v) is a constant, for all u, v; ∈ V(G). A graph G is called (s, d) magic graph if it admits (s, d) magic labeling. In this paper the existence of (s, d) magic labeling in some ladder graphs are found. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|