Results 91 to 100 of about 201,420 (145)
The concept of labeling of graphs has attracted many researchers to this branch of research since the concept was introduced. It is becoming popular, partly because of mathematical challenges, and partly also because of the wide range of applications in ...
Oudone Phanalasy (21269891)
core
Super antimagic total labeling of graphs
, 2008 Let G = (V, E) be a simple, finite and undirected graph with v vertices and e edges, A graph labeling is a mapping from elements of a graph to a set of numbers (usually positive integers).
Miller, Mirka +2 more
core
ON SUPER (a, d)- -ANTIMAGIC TOTAL LABELING OF STAR GRAPH K1,n [PDF]
, 2019 Let ( ) and ( ) be simple and finite graphs, and be a subgraph of . Let | | | | | | dan | | . Covering of is a family of different subgraphs such that every edge in belongs to at least one of subgraph . If isomorphic to , then admits an -Covering.
Mukti, Laras Indah Sinanding Dwi Argo
core +1 more source
, 2017 設圖G 是一由n 個點及m 條邊組成的有限簡單圖，圖G 的一個標號指的是在圖G 的每一個邊標上一個{1, 2, · · · ,m} 內的整數，且不同邊有不同標號。給定圖G 一個標號，定義每個頂點的頂點和是這個點所有連出去的邊的標號總和，若圖G 所有頂點的頂點和都不一樣，則稱此標號為反魔方標號；設f 是圖G 的一個反魔方標號，且對於任兩個度數不同的頂點u, v, deg(u) < deg(v)，若u 的頂點和嚴格小於v 的頂點和，則稱f 是圖G 的一個強反魔方標號。另外，若圖G 存在一個(強 ...
黃梓彥, Huang, Tzu-Yen
core
COMPLEMENTARY TOTALLY ANTIMAGIC TOTAL GRAPHS
, 2017 <p>For a graph G, with the vertex set V(G) and the edge set E(G), a total labeling is a bijection f from V (G) U E(G) to the set of integers {1, 2, …, |V (G) |+| E(G) |}.
Mallikarjun Ghaleppa*, Danappa G Akka
core +1 more source
Local edge antimagic coloring for chain of path and cycle
Indonesian Journal of CombinatoricsLet G=(V,E) be a simple connected graph with vertex set V and edge set E. A local edge antimagic labeling of G is a bijection f:V (G)→{1, 2, 3, ... , |V(G)|} where the weights of any two adjacent edges of G are distinct.
Yosua Walfried +2 more
doaj +1 more source
On the RACN of the comb product of the cycle C_3 with path P_n and broom Br_(n,m)
Journal Focus Action of Research MathematicThe combination of rainbow coloring and anti-magic labeling is known as Rainbow Antimagic Coloring (RAC). The Rainbow Antimagic Connection Number (RACN) of a graph G is the smallest number of colors induced by all edge weights under an antimagic labeling,
Brian Juned Septory +2 more
doaj +1 more source
On antimagic labeling for generalized web and flower graphs
, 2011 An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, . . . , q} such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels of all edges ...
Miller, Mirka +3 more
core
Distance Antimagic Labeling for Copies of Graph
Let G be a graph with vertex set V(G) and edge set E(G). Let f be a bijective function from the vertex set V(G) to the set {1,2,3,... ,|V(G)|} and weight of vertex v in V(G) is the sum of labels of all neighbors of vertex v.
Peter John +2 more
core +1 more source
SUPER (a; d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED SUNFLOWERS GRAPH [PDF]
, 2017 A graph of order and size is called an(,)-edge-antimagic if there exist a bijection ∶ () ∪ () → {1,2,…, + }such that the edge-weights() = () + () + (), ∈ (), form an arithmetic sequence with first term term and common difference.
rhomdani, rohmad wahid
core