Results 91 to 100 of about 580,661 (153)
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 The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2019 Let be a nontrivial and connected graph of vertex set and edge set . A bijection is called a local edge antimagic labeling if for any two adjacent edges and , where for . Thus, the local edge antimagic labeling induces a proper edge coloring of G if
Siti Aisyah +4 more
doaj +1 more source
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
Super (a,d)-P_2⨀P_m-Antimagic Total Labeling of Corona Product of Two Paths
JTAM (Jurnal Teori dan Aplikasi Matematika)Graph labeling involves mapping the elements of a graph (edges and vertices) to a set of positive integers. The concept of an anti-magic super outer labeling (a,d)-H pertains to assigning labels to the vertices and edges of a graph using natural numbers {
Bela Zainun Yatin +2 more
doaj +1 more source
, 2013 For an arbitrary set of distances $D\subseteq \{0,1, \ldots, diam(G)\}$, a $D$-weight of a vertex $x$ in a graph $G$ under a vertex labeling $f:V\rightarrow \{1,2, \ldots , v\}$ is defined as $w_D(x)=\sum_{y\in N_D(x)} f(y)$, where $N_D(x) = \{y \in V| d(x,y) \in D\}$. A graph $G$ is said to be $D$-distance magic if all vertices has the same $D$-vertex-
Simanjuntak, Rinovia, Wijaya, Kristiana
openaire +2 more sources
On d-antimagic labelings of plane graphs
Electronic Journal of Graph Theory and Applications, 2013 The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called d-antimagic if for every positive integer s, the s-sided face weights form an arithmetic progression with a difference d.
Martin Baca +4 more
openaire +4 more sources
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
-super antimagic total labeling of comb product of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 Let and be two simple, nontrivial and undirected graphs. Let be a vertex of , the comb product between and , denoted by , is a graph obtained by taking one copy of and copies of and grafting the th copy of at the vertex to the th vertex of .
Ika Hesti Agustin +2 more
doaj +1 more source
Pewarnaan Lokal Wilayah Super Antimagic Pada Graf Planar
, 2018 Konsep pewarnaan graf puncaknya muncul pada tahun 1976, yaitu sebagai hasil dari pemecahan persoalan 4 warna. Setelahnya muncul konsep pelabelan graf.
RATRI, Arum Andary
core
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 +2 more sources