On S-magic labeling of graph products
| dc.contributor.author | Almeida, Maurice | |
| dc.date.accessioned | 2026-05-05T10:34:06Z | |
| dc.date.available | 2026-05-05T10:34:06Z | |
| dc.date.issued | 2025 | |
| dc.description.abstract | Let G=(V, E) be a graph and let S be a set of positive integers with| S|=| V|. The graph G is said to be S-magic if there exists a bijection l: Vā S such that the weight of any vertex u, which is defined as the sum of labels on vertices adjacent to u, is a constant k for all uā V. The constant k is called an S-magic constant. The set of all S-magic constants of G for different labeling sets is denoted by M (G). In this paper, we study S-magic labelings of various graph products like lexicographic products of graphs with C4, direct products of graphs with C4, Cartesian products of graphs with C4, corona products of graphs, and joins of graphs. We find various classes of the above graph products that do not admit an S-magic labeling. We also give S-magic labeling conditions for several classes of the above graph products that do admit S-magic labelings, and we determine M (G) for these classes of graphs. | |
| dc.identifier.citation | Almeida, M., & Singh, T. On S-magic labeling of graph products. | |
| dc.identifier.uri | http://rcca.ndl.gov.in/handle/123456789/554 | |
| dc.language.iso | en | |
| dc.publisher | BULLETIN OF THE ICA Volume 106 (2026), 59ā81 | |
| dc.title | On S-magic labeling of graph products | |
| dc.type | Article |