In this paper, a complete characterization of the (super) edge-magic linear forests with two components is provided. In the process of es-tablishing this characterization, the super edge-magic, harmonious, se-quential and felicitous properties of certain 2-regular graphs are investi-gated, and several results on super edge-magic and felicitous labelings of unions of cycles and paths are presented. These labelings resolve one conjecture on harmonious graphs as a corollary, and make head-way towards the resolution of others. They also provide the basis for some new conjectures (and a weaker form of an old one) on labelings of 2-regular graphs
Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vert...
AbstractWe generalize the notion of the super edge-magic labeling of graphs to the notion of the sup...
Graph labelings has experimented a fast development during the last four decades. Two books dedicate...
In this paper, a complete characterization of the (super) edge-magic linear forests with two compone...
A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) → ...
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...
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...
We investigate three graph polynomials including antimagic, super edge-magic, and chromatic polynomi...
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graph...
An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of v...
Let C = (M, N) be a finite, undirected and simple graph with |M(C)| = t and |N(C)| = s. The labeling...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to o...
We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-...
Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vert...
AbstractWe generalize the notion of the super edge-magic labeling of graphs to the notion of the sup...
Graph labelings has experimented a fast development during the last four decades. Two books dedicate...
In this paper, a complete characterization of the (super) edge-magic linear forests with two compone...
A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) → ...
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...
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...
We investigate three graph polynomials including antimagic, super edge-magic, and chromatic polynomi...
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graph...
An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of v...
Let C = (M, N) be a finite, undirected and simple graph with |M(C)| = t and |N(C)| = s. The labeling...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to o...
We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-...
Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vert...
AbstractWe generalize the notion of the super edge-magic labeling of graphs to the notion of the sup...
Graph labelings has experimented a fast development during the last four decades. Two books dedicate...
Add to ORKG