Add to ORKGThis paper is mainly devoted to generate (special)(super) edge-magic labelings of graphs using matrices. Matrices are used in order to find lower bounds for the number of non-isomorphic (special)(super) edge-magic labelings of certain types of graphs. Also new applications of graph labelings are discussed
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications ...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
This paper is mainly devoted to generate (special)(super) edge-magic labelings of graphs using matri...
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...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to o...
Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes...
In this paper, we are studying vertex-magic total labelings (VMTLs) of simple graphs. By now much is...
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to o...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
Graph labelings has experimented a fast development during the last four decades. Two books dedicate...
In graph theory, a graph labeling is an assignment of labels to the edges and vertices of a graph. T...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications ...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
This paper is mainly devoted to generate (special)(super) edge-magic labelings of graphs using matri...
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...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to o...
Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes...
In this paper, we are studying vertex-magic total labelings (VMTLs) of simple graphs. By now much is...
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to o...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
Graph labelings has experimented a fast development during the last four decades. Two books dedicate...
In graph theory, a graph labeling is an assignment of labels to the edges and vertices of a graph. T...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications ...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...