Results 51 to 60 of about 580,661 (153)
Computing Edge Weights of Magic Labeling on Rooted Products of Graphs
Mathematical Problems in Engineering, Volume 2020, Issue 1, 2020., 2020 Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering. For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric labels assigned to the converted graph under certain ...
Jia-Bao Liu +3 more
wiley +1 more source
On the (Consecutively) Super Edge‐Magic Deficiency of Subdivision of Double Stars
Journal of Mathematics, Volume 2020, Issue 1, 2020., 2020 Let G be a finite, simple, and undirected graph with vertex set V(G) and edge set E(G). A super edge‐magic labeling of G is a bijection f : V(G) ∪ E(G)⟶{1,2, …, |V(G)| + |E(G)|} such that f(V(G)) = {1,2, …, |V(G)|} and f(u) + f(uv) + f(v) is a constant for every edge uv ∈ E(G).
Vira Hari Krisnawati +4 more
wiley +1 more source
Tree‐Antimagicness of Web Graphs and Their Disjoint Union
Mathematical Problems in Engineering, Volume 2020, Issue 1, 2020., 2020 In graph theory, the graph labeling is the assignment of labels (represented by integers) to edges and/or vertices of a graph. For a graph G = (V, E), with vertex set V and edge set E, a function from V to a set of labels is called a vertex labeling of a graph, and the graph with such a function defined is called a vertex‐labeled graph.
Zhijun Zhang +6 more
wiley +1 more source
The Integer-antimagic Spectra of Graphs with a Chord
Theory and Applications of Graphs, 2021 Let $A$ be a nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if there exists an edge labeling $f: E(G) \to A \setminus \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \sum_{uv\in E(G)}f(
Richard Low, Dan Roberts, Jinze Zheng
doaj +1 more source
H‐Coverings of Path‐Amalgamated Ladders and Fans
Mathematical Problems in Engineering, Volume 2020, Issue 1, 2020., 2020 Let G be a connected, simple graph with finite vertices v and edges e. A family G1,G2,…,Gp⊂G of subgraphs such that for all e ∈ E, e∈Gl, for some l, l = 1,2, …, p is an edge‐covering of G. If Gl≅ℍ, ∀l, then G has an ℍ‐covering. Graph G with ℍ‐covering is an (ad, d)‐ℍ‐antimagic if ψ:VG∪EG⟶1,2,…,v+e a bijection exists and the sum over all vertex‐weights ...
Yijun Xiong +6 more
wiley +1 more source
On the Construction of the Reflexive Vertex k‐Labeling of Any Graph with Pendant Vertex
International Journal of Mathematics and Mathematical Sciences, Volume 2020, Issue 1, 2020., 2020 A total k‐labeling is a function fe from the edge set to first natural number ke and a function fv from the vertex set to non negative even number up to 2kv, where k = max{ke, 2kv}. A vertex irregular reflexive k -labeling of a simple, undirected, and finite graph G is total k‐labeling, if for every two different vertices x and x′ of G, wt(x) ≠ wt(x′),
I. H. Agustin +5 more
wiley +1 more source
Regular Graphs of Odd Degree Are Antimagic [PDF]
Journal of Graph Theory, 2014 AbstractAn antimagic labeling of a graph G with m edges is a bijection from to such that for all vertices u and v, the sum of labels on edges incident to u differs from that for edges incident to v. Hartsfield and Ringel conjectured that every connected graph other than the single edge K2 has an antimagic labeling.
Daniel W. Cranston +2 more
openaire +3 more sources
New Results of Face Labeling for Some Plane Graphs
IEEE Access, 2019 A labeling of a plane graph is called super d-antimagic if the vertices receive the smallest labels and the weight set of all faces in an arithematic progression with difference d, where weight of each face is the some of all labels correspond to that ...
Nabila Hameed +4 more
doaj +1 more source
Local edge (a, d) –antimagic coloring on sunflower, umbrella graph and its application
Alifmatika, 2023 Suppose a graph G = (V, E) is a simple, connected and finite graph with vertex set V(G) and an edge set E(G). The local edge antimagic coloring is a combination of local antimagic labelling and edge coloring.
Robiatul Adawiyah +2 more
doaj +1 more source
The antimagicness of the Cartesian product of graphs
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuchen Zhang, Xiaoming Sun 0001
openaire +3 more sources