Results 101 to 110 of about 1,609,249 (128)

Antimagic labeling in butterfly and benes networks

Journal of Discrete Mathematical Sciences and Cryptography
This paper focus on the dynamic and rapidly evolving field of Graph Labeling research. In this paper, Antimagic Labeling for Benes and Butterfly networks has been determined.
G. Sarmitha, S. Vidyanandini, Soumyabrata Nayak   +2 more
semanticscholar   +1 more source

Vertex-Antimagic Total Labelings

2019
Following the chapters on magic type labelings, this chapter begins the section of the book devoted to antimagic labelings. Vertex antimagic and super vertex antimagic labelings, both edge labels and total labels are investigated with labeling constrictions given for connected and disconnected graphs.
Martin Bača, Mirka Miller, Joe Ryan, Andrea Semaničová-Feňovčíková   +3 more
openaire   +1 more source

Antimagic labelling of vertex weighted graphs

Journal of Graph Theory, 2011
AbstractSuppose G is a graph, k is a non‐negative integer. We say G is k‐antimagic if there is an injection f: E→{1, 2, …, |E| + k} such that for any two distinct vertices u and v, . We say G is weighted‐k‐antimagic if for any vertex weight function w: V→ℕ, there is an injection f: E→{1, 2, …, |E| + k} such that for any two distinct vertices u and v, .
Wong, Tsai-Lien, Zhu, Xuding
openaire   +1 more source

Vertex-antimagic labelings of regular graphs

Acta Mathematica Sinica, English Series, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmad, Ali, Ali, Kashif, Bača, Martin, Kovář, Petr, Semaničová-Feňovčíková, Andrea   +4 more
openaire   +2 more sources

Distance Antimagic Labelings of Graphs

2017
Let \(G=(V,E)\) be a graph of order n. Let \(f: V(G)\rightarrow \{1,2,\dots ,n\}\) be a bijection. For any vertex \(v \in V,\) the neighbor sum \(\sum \limits _{u\in N(v)}f(u)\) is called the weight of the vertex v and is denoted by w(v). If \(w(x) \ne w(y)\) for any two distinct vertices x and y, then f is called a distance antimagic labeling. A graph
N. Kamatchi, G. R. Vijayakumar, A. Ramalakshmi, S. Nilavarasi, S. Arumugam   +4 more
openaire   +1 more source

Some Distance Antimagic Labeled Graphs

2016
Let G be a graph of order n. A bijection $$f:VG \longrightarrow \{1, 2, \ldots , n\}$$ is said to be distance antimagic if for every vertex v the vertex weight defined by $$w_fv =\sum _{x\in Nv}fx$$ is distinct. The graph which admits such a labeling is called a distance antimagic graph. For a positive integer k, define $$f_{k}:VG \longrightarrow \{1+k,
Adarsh K. Handa, Aloysius Godinho, Tarkeshwar Singh   +2 more
openaire   +1 more source

Super Face Antimagic Labelings of Union of Antiprisms

Mathematics in Computer Science, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin, Numan, Muhammad, Siddiqui, Muhammad Kamran   +2 more
openaire   +1 more source

EVEN AND ODD ANTIMAGIC TOTAL LABELING ON TOTAL GRAPH OF PATHS AND CYCLES

Statistics, Optimization & Information Computing
Consider a graph G = (V,E) with s nodes and t links. In this paper, we introduce two types of labeling, namely odd-vertex(edge) antimagic total labeling and even-vertex(edge) antimagic total labeling. A vertex(edge) antimagic total labeling is called odd
N. Nagaparvatham, T. Kannan, C. Nagaraj
semanticscholar   +1 more source

Super (a,d)-C_m-Antimagic Total Labeling of Generalized Book Graphs

International journal of research and review
A graph is considered to admit a covering if every edge of lies in a subgraph isomorphic to . We refer to as super antimagic total when there exists a bijection with such that the weights of all subgraphs isomorphic to , defined by , form an arithmetic ...
Niswah Qonita, Agista Surya Bawana
semanticscholar   +1 more source

Super (a, d)-hyperedge antimagic total labeling on hypergraphs of the volcano graph, semi parachute graph, and comb product graph

Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika
In graph theory, understanding the labeling of graphs and hypergraphs provides valuable insights into their structural properties and applications. A hypergraph generalizes the notion of a conventional graph, defined as a mathematical structure built ...
R. Adawiyah, Okta Endri Asari, D. Dafik, A. Kristiana, R. M. Prihandini, A. Rohini   +5 more
semanticscholar   +1 more source