Results 11 to 20 of about 412,708 (144)
Computing Edge Weights of Symmetric Classes of Networks [PDF]
Mathematical Problems in Engineering, Volume 2021, Issue 1, 2021., 2021 Accessibility, robustness, and connectivity are the salient structural properties of networks. The labelling of networks with numeric numbers using the parameters of edge or vertex weights plays an eminent role in the study of the aforesaid properties.
Hafiz Usman Afzal +4 more
wiley +4 more sources
Two constructions of -antimagic graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph. A graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . A graph admitting an -covering is called --antimagic if there is a bijection such that for each subgraph of isomorphic to , the sum of labels of all the
Andrea Semaničová-Feňovčíková +2 more
doaj +4 more sources
Antimagic Labeling of Some Biregular Bipartite Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2022 An antimagic labeling of a graph G = (V, E) is a one-to-one mapping from E to {1, 2, . . ., |E|} such that distinct vertices receive different label sums from the edges incident to them. G is called antimagic if it admits an antimagic labeling.
Deng Kecai, Li Yunfei
doaj +2 more sources
Distance Antimagic Product Graphs
Symmetry, 2022 A distance antimagic graph is a graph G admitting a bijection f:V(G)→{1,2,…,|V(G)|} such that for two distinct vertices x and y, ω(x)≠ω(y), where ω(x)=∑y∈N(x)f(y), for N(x) the open neighborhood of x. It was conjectured that a graph G is distance antimagic if and only if G contains no two vertices with the same open neighborhood.
Rinovia Simanjuntak, Aholiab Tritama
openaire +3 more sources
Regular Graphs are Antimagic [PDF]
The Electronic Journal of Combinatorics, 2015 An undirected simple graph $G=(V,E)$ is called antimagic if there exists an injective function $f:E\rightarrow\{1,\dots,|E|\}$ such that $\sum_{e\in E(u)} f(e)\neq\sum_{e\in E(v)} f(e)$ for any pair of different nodes $u,v\in V$. In this note we prove — with a slight modification of an argument of Cranston et al. — that $k$-regular graphs are antimagic
Kristóf Bérczi +2 more
core +6 more sources
Graphs of Large Linear Size Are Antimagic [PDF]
Journal of Graph Theory, 2015 AbstractGiven a graph and a colouring , the induced colour of a vertex v is the sum of the colours at the edges incident with v. If all the induced colours of vertices of G are distinct, the colouring is called antimagic. If G has a bijective antimagic colouring , the graph G is called antimagic.
Feihuang Chang; Yu-Chang Liang; Zhishi Pan; Xuding Zhu
openaire +3 more sources
On total labelings of graphs with prescribed weights
AKCE International Journal of Graphs and Combinatorics, 2016 Let G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic total labeling of G is a bijection f from V(G)∪E(G) onto the set of consecutive integers {1,2,…,|V(G)|+|E(G)|}, such that all the edge weights or vertex weights ...
Muhammad Irfan +1 more
doaj +4 more sources
ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS [PDF]
Journal of Algebraic Systems, 2020 A {it local antimagic labeling} of a connected graph $G$ with at least three vertices, is a bijection $f:E(G) rightarrow {1,2,ldots , |E(G)|}$ such that for any two adjacent vertices $u$ and $v$ of $G$, the condition $omega _{f}(u) neq omega _{f}(v ...
S. Shaebani
doaj +3 more sources
Antimagic and Product Antimagic Graphs with Pendant Edges
Mediterranean Journal of MathematicsAbstract Let $$G=(V,E)$$ G = ( V ,
Mora Giné, Mercè +1 more
openaire +4 more sources
Local antimagic vertex coloring of unicyclic graphs
Indonesian Journal of Combinatorics, 2018 The local antimagic labeling on a graph G with |V| vertices and |E| edges is defined to be an assignment f : E --> {1, 2,..., |E|} so that the weights of any two adjacent vertices u and v are distinct, that is, w(u)̸ ̸= w(v) where w(u) = Σe∈E(u) f(e)
Nuris Hisan Nazula, S Slamin, D Dafik
doaj +2 more sources