Add to ORKGA graph G is said to have a totally magic cordial (TMC) labeling with constant C if there exists a mapping ƒ : V (G) ∪ E(G) → {0, 1} such that ƒ(a)+ ƒ (b)+ ƒ(ab) ≡ C(mod 2) for all ab ∈ E(G) and [formula], where nƒ(i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we establish the totally magic cordial labeling of one-point union of n-copies of cycles, complete graphs and wheels
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
Tyt. z nagłówka.Bibliogr. s. 121.A graph G is said to have a totally magic cordial (TMC) labeling wi...
ABSTRACT ARTICLE INFO A graph G is said to have a totally magic cordial la-beling with constant C if...
In this paper we define total magic cordial (TMC) and total sequential cordial (TSC) labellings whic...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
AbstractIn this paper we give an equivalent definition of a cordial graph. The definition implies a ...
A vertex magic labelling on a graph with v vertices and e edges is a one-to-one map taking the verti...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
A totally magic labeling of a graph with v vertices and e edges is a one-to-one map taking the verti...
Abstract. Let G be a graph with vertex set V = V (G) and edge set E = E(G) and let e = |E(G) | and v...
Let G = (V, E) be a finite non-empty graph. A vertex-magic total labeling (VMTL) is a bijection lamb...
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
Tyt. z nagłówka.Bibliogr. s. 121.A graph G is said to have a totally magic cordial (TMC) labeling wi...
ABSTRACT ARTICLE INFO A graph G is said to have a totally magic cordial la-beling with constant C if...
In this paper we define total magic cordial (TMC) and total sequential cordial (TSC) labellings whic...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
AbstractIn this paper we give an equivalent definition of a cordial graph. The definition implies a ...
A vertex magic labelling on a graph with v vertices and e edges is a one-to-one map taking the verti...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
A totally magic labeling of a graph with v vertices and e edges is a one-to-one map taking the verti...
Abstract. Let G be a graph with vertex set V = V (G) and edge set E = E(G) and let e = |E(G) | and v...
Let G = (V, E) be a finite non-empty graph. A vertex-magic total labeling (VMTL) is a bijection lamb...
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...