Odd harmonious labeling of grid graphs
Author
Jeyanthi, P.
Philo, S.
Youssef, Maged Z.
Abstract
A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G) → {0, 1, 2, · · · , 2q − 1} such that the induced function f* : E(G) → {1, 3, · · · , 2q − 1} defined by f∗ (uv) = f (u) + f (v) is a bijection. In this paper we prove that path union of t copies of Pm×Pn, path union of t different copies of Pmᵢ×Pnᵢ where 1 ≤ i ≤ t, vertex union of t copies of Pm×Pn, vertex union of t different copies of Pmᵢ×Pnᵢ where 1 ≤ i ≤ t, one point union of path of Ptn (t.n.Pm×Pm), t super subdivision of grid graph Pm×Pn are odd harmonious graphs.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
Graceful centers of graceful graphs and universal graceful graphs.
Makadia, H. M.; Karavadiya, H. M.; Kaneria, V. J.. Proyecciones. Journal of Mathematics; Vol 38 No 2 (2019); 305-314 -
Equitable Graph of a Graph
Dharmalingam, Kuppusamy Makandan. Proyecciones. Journal of Mathematics; Vol 31 No 4 (2012); 363-372 -
Irregularity indices for line graph of Dutch windmill graph
Mohammed, Mohanad A.; AL-Mayyahi, Suad Younus A. AL-Mayyahi; Virk, Abaid ur Rehman; Rehman, Hafiz Mutee ur. Proyecciones (Antofagasta, On line); Vol. 39 No. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 903-918