Results 101 to 110 of about 580,661 (153)

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

Super (a,d)-$H$- Antimagic Total Covering of Chain Graph

, 2016
All graph in this paper are finite, simple and undirected. By $H'$-covering, we mean every edge in $E(G)$ belongs to at least one subgraph of $G$ isomorphic to a given graph $H$.
Dina Rizki Anggraini., Dafik., Susi Setiawani
core  

(a,d)-edge-antimagic total labelings of caterpillars

, 2005
For a graph G = (V,E), a bijection g from V (G)∪E(G) into {1, 2, ..., |V (G)|+|E(G)|} is called (a, d)-edge-antimagic total labeling of G if the edge-weights w(xy) = g(x) + g(y) + g(xy), xy ∈ E(G), form an arithmetic progression with initial term a and ...
Miller, Mirka, M. Bača, Slamin,, Baca, Martin, M. Miller, Sugeng, Kiki Ariyanti, K. A. Sugeng, null Slamin   +7 more
core   +1 more source

Antimagic Labeling for Some Snake Graphs

Proyecciones (Antofagasta)
A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. In this paper we study antimagic labeling of double triangular snake, alternate triangular snake, double alternate triangular snake, quadrilateral snake, double ...
Chirag Barasara, Palak Prajapati
openaire   +1 more source

Totally antimagic total graphs

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 ...
Anita Abildgaard Sillasen (21325523), Andrea Semaničová-Feňovčíková (21276170), Martin Bača (21296276), Mirka Miller (13548124), Oudone Phanalasy (21269891), Joseph Ryan (21132233)   +5 more
core  

Sparse graphs with vertex antimagic edge labelings

, 2013
Hartsfeld and Ringel in 1990 introduced the concept of an antimagic labeling of a graph, that is, a vertex antimagic edge labeling and they also conjectured that every connected graph, except K2, is antimagic.
Miller, Mirka, Rylands, Leanne J. (R8511), Phanalasy, Oudone, Ryan, Joe   +3 more
core  

The Development of Kriptosistem Polyalphabetic Cipher with Total Antimagic Edges Labeling on Tribune Graph

, 2017
A graph G of order p and size q is an called an (a,d)-edge antimagic total if there exist a bijection f:(V(G)E(G))? {1,2,...,p+q} such that the edge-weights, w(uv) =f(u)+f(v)+f(uv); ; uv,(G) form an arithmetic sequence with ¯first term a and common ...
Mahmudah, Muhlisatul
core  

Antimagic labeling of graphs

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  

Antimagic labelings of caterpillars

A k-antimagic labeling of a graph G is an injection from E(G) to {1,2, ..., |E(G)|+k} such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to edges incident to u.
Seara Ojea, Carlos, Mora Giné, Mercè, Lozano Bojados, Antoni   +2 more
core  

QSPR graph model to explore physicochemical properties of potential antiviral drugs of dengue disease through novel coloring-based topological indices. [PDF]

Front Chem
Yogalakshmi C, Balamurugan BJ.
europepmc   +1 more source