Faculty Publications

Permanent URI for this community

http://rcca.ndl.gov.in/handle/123456789/364

Browse

Browsing Faculty Publications by Author "Almeida, Maurice"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    ANALYSIS OF UNEMPLOYMENT AMONG MOTHERS IN GOA
    (Education and Society, 2023) Almeida, Maurice
  • Thumbnail Image
    Item
    Local Distance Antimagic Labeling of Generalized Mycielskian Graphs
    (Ars Combinatoria, 164, 33-55, 2025) Almeida, Maurice; De Sa, Kingel Savia
    Let G = (V, E) be a graph of order n without isolated vertices. A bijection f: V → {1, 2, . . . , n} is called a local distance antimagic labeling, if w(u) ̸= w(v) for every edge uv of G, where w(u) = P x∈N(u) f(x). The local distance antimagic chromatic number χld(G) is de ned to be the minimum number of colors taken over all colorings of G induced by local distance antimagic labelings of G. The concept of Generalized Mycielskian graphs was introduced by Stiebitz [20]. In this paper, we study the local distance antimagic labeling of the Generalized Mycielskian graphs.
  • Thumbnail Image
    Item
    On S-magic labeling of graph products
    (BULLETIN OF THE ICA Volume 106 (2026), 59–81, 2025) Almeida, Maurice
    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.