Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of DSpace
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "De Sa, Kingel Savia"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • Loading...
    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.

DSpace software copyright © 2002-2026 LYRASIS

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback