Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

The Distance Magic Index of a Graph

100%

Godinho A., Singh T., Arumugam S.

Discussiones Mathematicae Graph Theory

2017

tom 38

nr 1

135-142

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Arumugam S.

1 Godinho A.

1 Singh T.

1 2018

Wyniki wyszukiwania

The Distance Magic Index of a Graph