Results 71 to 80 of about 532 (81)
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 +2 more
doaj +1 more source
A-vertex magicness of product of graphs
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
Altitude of wheels and wheel-like graphs
Dzido Tomasz, Furmańczyk Hanna
doaj +1 more source
Note on group distance magic complete bipartite graphs
Cichacz Sylwia
doaj +1 more source
Note on extremal problems about connected subgraph sums. [PDF]
Cambie S, Groenland C.
europepmc +1 more source
The local vertex anti-magic coloring for certain graph operations. [PDF]
Uma L, Rajasekaran G.
europepmc +1 more source
Computing dominant metric dimensions of certain connected networks. [PDF]
Ali I, Javaid M, Shang Y.
europepmc +1 more source
Further results on the radio number for some construction of the path, complete, and complete bipartite graphs. [PDF]
Mari B, Jeyaraj RS.
europepmc +1 more source
Prime labeling of graphs constructed from wheel graph. [PDF]
Abughazaleh B, Abughneim OA.
europepmc +1 more source
A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups. [PDF]
Gollin JP +4 more
europepmc +1 more source

