Results 41 to 50 of about 920 (119)
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
Super (a; d)-star-antimagic graphs
Hacettepe Journal of Mathematics and Statistics, 2018 Summary: A simple graph \(G=(V,E)\) admitting an \(H\)-covering is said to be \((a,d)\)-\(H\)-antimagic if there exists a bijection \(f : V \cup E \rightarrow \{1,2,\dots,|V| + |E|\}\) such that, for all subgraphs \(H'\) of \(G\) isomorphic to \(H\), \(wt_f(H') = \sum_{v \in V(H')}f(v)+\sum_{e \in E(H')}f(e)\), form an arithmetic progression \(a\), \(a+
SELVAGOPAL, Pothukutti Nadar +3 more
openaire +3 more sources
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
PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN L_n (q,r)
E-Jurnal Matematika, 2017 Graph labelling is a function that maps graph elements to positive integers. A covering of graph is family subgraph from , for with integer k. Graph admits covering if for every subgraph is isomorphic to a graph .
TIRA CATUR ROSALIA +2 more
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
Trees whose even-degree vertices induce a path are antimagic [PDF]
, 2019 An antimagic labeling a connected graph $G$ is a bijection from the set of edges $E(G)$ to $\{1,2,\dots,|E(G)|\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $v$ is the sum of the labels assigned to edges incident to ...
Lozano, Antoni +3 more
core +3 more sources
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
On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture [PDF]
, 2017 International audienceThis paper is dedicated to studying the following question: Is it always possible to injectively assign the weights 1, ..., |E(G)| to the edges of any given graph G (with no component isomorphic to K2) so that every two adjacent ...
Bensmail, Julien +2 more
core +5 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