(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: | Sumathi P., Mala P. |
---|---|
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 |
Similar Items
Similar Items
-
Napoleon Hill's magic ladder to success /
by: 246135 Hill, Napoleon
Published: (2004) -
On distance magic labelings of Hamming graphs and folded hypercubes
by: Štefko Miklavič, et al.
Published: (2024-01-01) -
The Detour Polynomials of Ladder Graphs
by: Ali Ali, et al.
Published: (2012-07-01) -
Efficient Graph Network Using Total Magic Labeling and Its Applications
by: Annamalai Meenakshi, et al.
Published: (2023-09-01) -
A totally magic cordial labeling of one-point union of n copies of a graph
by: P. Jeyanthi, et al.
Published: (2014-01-01)