(s, d) Magic Labeling of some ladder graphs
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(u...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2023-01-01
|
| Series: | E3S Web of Conferences |
| Online Access: | https://www.e3s-conferences.org/articles/e3sconf/pdf/2023/13/e3sconf_ersme2023_01110.pdf |
| _version_ | 1797850799068413952 |
|---|---|
| author | Sumathi P. Mala P. |
| author_facet | Sumathi P. Mala P. |
| author_sort | Sumathi P. |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-09T19:06:14Z |
| format | Article |
| id | doaj.art-cc042cb4822642f58e8c1350cdbecf6a |
| institution | Directory Open Access Journal |
| issn | 2267-1242 |
| language | English |
| last_indexed | 2024-04-09T19:06:14Z |
| publishDate | 2023-01-01 |
| publisher | EDP Sciences |
| record_format | Article |
| series | E3S Web of Conferences |
| spelling | doaj.art-cc042cb4822642f58e8c1350cdbecf6a2023-04-07T08:58:19ZengEDP SciencesE3S Web of Conferences2267-12422023-01-013760111010.1051/e3sconf/202337601110e3sconf_ersme2023_01110(s, d) Magic Labeling of some ladder graphsSumathi P.0Mala P.1Department of MathematicsDepartment of Mathematics, St Thomas College of Arts and ScienceLet 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.https://www.e3s-conferences.org/articles/e3sconf/pdf/2023/13/e3sconf_ersme2023_01110.pdf |
| spellingShingle | Sumathi P. Mala P. (s, d) Magic Labeling of some ladder graphs E3S Web of Conferences |
| title | (s, d) Magic Labeling of some ladder graphs |
| title_full | (s, d) Magic Labeling of some ladder graphs |
| title_fullStr | (s, d) Magic Labeling of some ladder graphs |
| title_full_unstemmed | (s, d) Magic Labeling of some ladder graphs |
| title_short | (s, d) Magic Labeling of some ladder graphs |
| title_sort | s d magic labeling of some ladder graphs |
| url | https://www.e3s-conferences.org/articles/e3sconf/pdf/2023/13/e3sconf_ersme2023_01110.pdf |
| work_keys_str_mv | AT sumathip sdmagiclabelingofsomeladdergraphs AT malap sdmagiclabelingofsomeladdergraphs |