Results 101 to 110 of about 201,420 (145)
Antimagic Total labeling of Disjoint Union of Disconnected Graph
YEAR/VOLUME/NUMBER/PAGE:2013/April/Ed IIIA network topology (either communication network in general or a network in a computer) can be modeled as a graph or a directed graph (digraph, for short), where each processing element is represented by a ...
Dafik
core
On the antimagicness of generalized edge corona graphs. [PDF]
D N, S DY.
europepmc +1 more source
QSPR graph model to explore physicochemical properties of potential antiviral drugs of dengue disease through novel coloring-based topological indices. [PDF]
Yogalakshmi C, Balamurugan BJ.
europepmc +1 more source
Antimagic and product antimagic graphs with pendant edges
Let $G=(V,E)$ be a simple graph of size $m$ and $L$ a set of $m$ distinct real numbers. An $L$-labeling of $G$ is a bijection $\phi: E \rightarrow L$.
Tey, Joaquín, Mora, Mercè
core
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) +5 more
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Antimagic labeling of biregular bipartite graphs
Discrete Applied Mathematics, 2023This paper investigates antimagic labeling of biregular bipartite graphs. For a biregular bipartite graph \(G[X, Y]\) with \(dG(x) = s\) for all \(x \in X\) and \(dG(y) = t\) for all \(y \in Y\), if \(s \ge t + 2 \) and there is an odd number in \(\{s, t\}\), then it is proved that \(G\) is antimagic.
exaly +2 more sources
Local antimagic labeling of graphs
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Donglei Yang, Jian-Liang Wu
exaly +4 more sources
Antimagic labeling for subdivisions of graphs
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei-Tian Li
exaly +3 more sources
Antimagic labeling and canonical decomposition of graphs
Information Processing Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael D Barrus
exaly +2 more sources

