AbstractAn edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,…,|V(G)∪E(G)| with the property that, given any edge (x,y), λ(x)+λ(x,y)+λ(y)=k for some constant k. The labeling is strong if all the smallest labels are assigned to the vertices. Enomoto et al. proved that a graph admitting a strong labeling can have at most 2|V(G)|-3 edges. In this paper we study graphs of this maximum size
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
Let $G$ be a finite simple undirected $(p,q)$-graph, with vertex set $V(G)$ and edge set $E(G)$ such...
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
AbstractAn edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2...
A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) → ...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
Let G=(V,E) be a finite graph, where |V|=n≥2 and |E|=e≥1. A vertex-magic total labeling is a bijecti...
A super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1...
AbstractA graph G of order n and size m is edge-magic if there is a bijection l:V(G)∪E(G)→[n+m] such...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
Let $G$ be a finite simple undirected $(p,q)$-graph, with vertex set $V(G)$ and edge set $E(G)$ such...
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
AbstractAn edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2...
A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) → ...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
Let G=(V,E) be a finite graph, where |V|=n≥2 and |E|=e≥1. A vertex-magic total labeling is a bijecti...
A super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1...
AbstractA graph G of order n and size m is edge-magic if there is a bijection l:V(G)∪E(G)→[n+m] such...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
Let $G$ be a finite simple undirected $(p,q)$-graph, with vertex set $V(G)$ and edge set $E(G)$ such...
DOI
Add to ORKG