| Issue |
E3S Web Conf.
Volume 376, 2023
International Scientific and Practical Conference “Environmental Risks and Safety in Mechanical Engineering” (ERSME-2023)
|
|
|---|---|---|
| Article Number | 01110 | |
| Number of page(s) | 8 | |
| Section | I Environmental Risks and Safety in Mechanical Engineering | |
| DOI | https://doi.org/10.1051/e3sconf/202337601110 | |
| Published online | 31 March 2023 | |
(s, d) Magic Labeling of some ladder graphs
1 Department of Mathematics, C. Kandaswami College for Men, Anna Nagar, Chennai-102
2 Department of Mathematics, St Thomas College of Arts and Science, Koyambedu, Chennai-107
* Corresponding author: sumathipaul@gmail.com
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.
© The Authors, published by EDP Sciences, 2023
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.