The Distance Magic Index of a Graph

• Autorzy: Aloysius Godinho , Tarkeshwar Singh , S. Arumugam
• Języki publikacji: EN

Abstrakty

EN

Let G be a graph of order n and let S be a set of positive integers with |S| = n. Then G is said to be S-magic if there exists a bijection ϕ : V (G) → S satisfying ∑x∈N(u) ϕ(x) = k (a constant) for every u ∈ V (G). Let α(S) = max{s : s ∈ S}. Let i(G) = min α(S), where the minimum is taken over all sets S for which the graph G admits an S-magic labeling. Then i(G) − n is called the distance magic index of the graph G. In this paper we determine the distance magic index of trees and complete bipartite graphs.

Słowa kluczowe

EN

distance magic labeling; distance magic index; S-magic graph; S-magic labeling

Kategorie tematyczne

• 05C78: Graph labelling (graceful graphs, bandwidth, etc.)

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 38
• Numer: 1
• Strony: 135-142

Daty

wydano

2018-02-01

otrzymano

2016-06-28

poprawiono

2016-10-20

zaakceptowano

2016-10-20

online

2017-12-30

Twórcy

autor

Aloysius Godinho

• , K K Birla Goa Campus, , Zuarinagar, Goa,

autor

Tarkeshwar Singh

• , K K Birla Goa Campus, , Zuarinagar, Goa,

autor

S. Arumugam

• , , Krishnankoil–, Tamil Nadu,

Identyfikatory

DOI

10.7151/dmgt.1998