Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · E3S Web of Conferences · 2023

(<i>s</i>, <i>d</i>) Magic Labeling of some ladder graphs

P. Sumathi, P. Mala

Cited by 0Open access

Abstract

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 + 2 d ,..... 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.

Cite this paper

APA 7

Sumathi, P., & Mala, P. (2023). (<i>s</i>, <i>d</i>) Magic Labeling of some ladder graphs. E3S Web of Conferences, 376, 01110. https://doi.org/10.1051/e3sconf/202337601110

MLA 9

Sumathi, P., and P. Mala. “(<i>s</i>, <i>d</i>) Magic Labeling of some ladder graphs.” E3S Web of Conferences, vol. 376, 2023, p. 01110, https://doi.org/10.1051/e3sconf/202337601110.

Chicago

Sumathi, P., and P. Mala. 2023. “(<i>s</i>, <i>d</i>) Magic Labeling of some ladder graphs.” E3S Web of Conferences 376: 01110. https://doi.org/10.1051/e3sconf/202337601110.

Harvard

Sumathi, P. and Mala, P. (2023) ‘(<i>s</i>, <i>d</i>) Magic Labeling of some ladder graphs’, E3S Web of Conferences, 376, p. 01110. Available at: https://doi.org/10.1051/e3sconf/202337601110.

BibTeX
@article{sumathi2023magic,
  title = {{(<i>s</i>, <i>d</i>) Magic Labeling of some ladder graphs}},
  author = {Sumathi, P. and Mala, P.},
  journal = {E3S Web of Conferences},
  volume = {376},
  pages = {01110},
  year = {2023},
  doi = {10.1051/e3sconf/202337601110}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers