Results 81 to 90 of about 920 (119)

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

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 Mathematic
The 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, Dwi Agustin Retnowardani, Kamal Dliou   +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, Ridho Alfarisi, Rafiantika M. Prihandini, Arika Indah Kristiana, Ratna Dwi Christyanti   +4 more
doaj   +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, Zata Yumni Awanis, I Gede Adhitya Wisnu Wardhana   +2 more
doaj   +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, R.M. Prihandini, Dafik   +2 more
doaj   +1 more source

Bipartite graphs are weak antimagic

, 2013
This paper has been withdrawn due to a flaw in the proof of the main ...
Beck, Matthias, Jackanich, Michael
openaire   +2 more sources

Inclusive distance antimagic graphs [PDF]

AIP Conference Proceedings, 2018
null Dafik, R. Alfarisi, R. M. Prihandini, R. Adawiyah, I. H. Agustin   +4 more
openaire   +1 more source

Totally antimagic total graphs

, 2015
For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, ., |V(G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge.
Bača, Martin, Miller, Mirka, Phanalasy, Oudone, Ryan, Joe, Semaničová-Feňovčíková, Andrea, Sillasen, Anita Abildgaard   +5 more
openaire   +1 more source

The Integer-antimagic Spectra of a Weak Join of Hamiltonian Graphs

Theory and Applications of Graphs
A simple graph $G$ with vertex set $V(G)$ and edge set $E(G)$ is \emph{$\mathbb{Z}_{k}$-antimagic} if there exists a function $f: E(G) \to \mathbb{Z}_{k} \backslash \{0\}$ such that the induced function $f^+(v)=\sum_{uv\in E(G)} f(uv)$ is injective. The \
Ugur Odabasi , Dan Roberts, Richard M. Low   +2 more
doaj   +1 more source

Complementary Totally Antimagic Total Graphs

, 2017
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) |}. The edge weight sum is f(u)+f(uv)+f(v) = k for every edge uv є E(G) and the vertex weight sum is f(u)+∑ᵥЄV (G ) f(uv) = k1 for vertex vєV(G) where k and k1 are constants called valences.
openaire   +1 more source