Generalized outerplanar index of a graph
Zahra Barati (2018)
Czechoslovak Mathematical Journal
Similarity:
We define the generalized outerplanar index of a graph and give a full characterization of graphs with respect to this index.
Zahra Barati (2018)
Czechoslovak Mathematical Journal
Similarity:
We define the generalized outerplanar index of a graph and give a full characterization of graphs with respect to this index.
Aloysius Godinho, Tarkeshwar Singh, S. Arumugam (2018)
Discussiones Mathematicae Graph Theory
Similarity:
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...
Anton Kundrík (1990)
Mathematica Slovaca
Similarity:
C. S., Jr. Johnson, Frederick R. McMorris (1982)
Mathematica Slovaca
Similarity:
D. M. Cvetković (1975)
Matematički Vesnik
Similarity:
Don R. Lick (1976)
Colloquium Mathematicae
Similarity:
Marián Sudolský (1978)
Mathematica Slovaca
Similarity: