Results 71 to 80 of about 935 (138)
Distance Magic Graphs - a Survey [PDF]
, 2011 Let <i>G = (V;E)</i> be a graph of order n. A bijection <i>f : V → {1, 2,...,n} </i>is called <i>a distance magic labeling </i>of G if there exists a positive integer k such that <i>Σ f(u) = k &
Arumugam, S. (S) +2 more
core
Weighted antimagic labeling: an algorithmic approach
Electronic Notes in Discrete Mathematics, 2015 Abstract A graph G = ( V , E ) is weighted-k-antimagic if for each w : V → R , there is an injective function f : E → { 1 , … , | E | + k } such that for each vertex u the following sums are all distinct: ∑ v : u v ∈ E f ( u v ) + w ( u ) .
Martín Matamala, José Zamora
openaire +1 more source
Regular graphs are antimagic [PDF]
, 2015 An undirected simple graph G = (V,E) is called antimagic if there exists an injective function f: E → {1,…|E|} such that (formula presented) for any pair of different nodes u, v ∈ V.
Bernáth, Attila +2 more
core
Super Total Labeling (a,d)- edge Antimagic on the Firecracker Graph
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2020 An (a, d)-edge-antimagic total labeling on (p, q)-graph G is a one-to-one map f from V (G) ∪ E(G) onto the integers 1, 2, . . . , p + q with the property that the edge-weights, w(uv) = f (u)+ f (v) + f (uv) where uv ∈ E(G),form an arithmetic ...
Juhari Juhari
doaj +1 more source
Minimum-Weight Edge Discriminator in Hypergraphs [PDF]
, 2012 In this paper we introduce the concept of minimum-weight edge-discriminators in hypergraphs, and study its various properties. For a hypergraph $\mathcal H=(\mathcal V, \mathcal E)$, a function $\lambda: \mathcal V\rightarrow \mathbb Z^{+}\cup\{0\}$ is ...
Bhattacharya, Bhaswar B. +2 more
core
Local antimagic vertex coloring of unicyclic graphs
Indonesian Journal of Combinatorics, 2018 The local antimagic labeling on a graph G with |V| vertices and |E| edges is defined to be an assignment f : E --> {1, 2,..., |E|} so that the weights of any two adjacent vertices u and v are distinct, that is, w(u)̸ ̸= w(v) where w(u) = Σe∈E(u) f(e)
Nuris Hisan Nazula, S Slamin, D Dafik
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
Vertex Antimagic Total Labeling of Digraphs
Kyungpook mathematical journal, 2015 In this paper we investigate the properties of (a, d)-vertex antimagic total labeling of a digraph D = (V, A). In this labeling, we assign to the vertices and arcs the consecutive integers from 1 to |V|+|A| and calculate the sum of labels at each vertex, i.e., the vertex label added to the labels on its out arcs.
J. PANDIMADEVI, S.P. SUBBIAH
openaire +2 more sources
On super (a,d)-Ph-antimagic total labeling of Stars
AKCE International Journal of Graphs and Combinatorics, 2015 Let G=(V,E) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edge in E(G) belongs to at least one subgraph of G that is isomorphic to H. An (a,d)-H-antimagic total labeling of G is bijection f:V(G)∪E(G)→{1,2,3,…,|V(G)|+|E(G)|}
S. David Laurence, KM. Kathiresan
doaj +1 more source
Drawing a Graph in a Hypercube
, 2004 A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross.
Wood, David R.
core +2 more sources