Results 81 to 90 of about 746 (100)

Optimal L(3,2,1)-labeling of trees

AKCE International Journal of Graphs and Combinatorics
Given a graph G, an [Formula: see text]-labeling of G is an assignment f of non-negative integers (labels) to the vertices of G such that [Formula: see text] if [Formula: see text] (i = 1, 2, 3).
Xiaoling Zhang
doaj   +1 more source

On the Beta-Number of Forests with Isomorphic Components

Discussiones Mathematicae Graph Theory, 2018
The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . .
Ichishima Rikio, López Susana-Clara, Muntaner-Batle Francesc Antoni, Oshima Akito   +3 more
doaj   +1 more source

On subset labelings of trees

AKCE International Journal of Graphs and Combinatorics
For a nontrivial graph G, a subset labeling of G is a labeling of the vertices of G with nonempty subsets of the set [Formula: see text] for a positive integer r such that two vertices of G have disjoint labels if and only if the vertices are adjacent ...
Gary Chartrand, Ebrahim Salehi, Ping Zhang   +2 more
doaj   +1 more source

On Distance Magic Harary Graphs

, 2018
This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for
Paramasivam, Krishnan, Prajeesh, A V
core  

A-vertex magicness of product of graphs

AKCE International Journal of Graphs and Combinatorics
In this paper, we discuss the A-vertex magicness of some products of graphs, where A is a non-trivial additive Abelian group with identity 0. We characterize A-vertex magicness of the Cartesian product of Pn and Pm, where A has at least three elements ...
S. Balamoorthy
doaj   +1 more source

On d-graceful labelings

, 2012
In this paper we introduce a generalization of the well known concept of a graceful labeling. Given a graph G with e=dm edges, we call d-graceful labeling of G an injective function from V(G) to the set {0,1,2,..., d(m+1)-1} such that {|f(x)-f(y)| | [x,y]
Pasotti, A.
core  

Altitude of wheels and wheel-like graphs

Open Mathematics, 2010
Dzido Tomasz, Furmańczyk Hanna
doaj   +1 more source

Note on group distance magic complete bipartite graphs

Open Mathematics, 2014
Cichacz Sylwia
doaj   +1 more source

FUZZY LABELING TREE

, 2014
A. Nagoorgani, D. R. Subahashini
semanticscholar   +1 more source

Computing dominant metric dimensions of certain connected networks. [PDF]

Heliyon
Ali I, Javaid M, Shang Y.
europepmc   +1 more source