Add to ORKGTyt. z nagłówka.Bibliogr. s. 121.A 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 nƒ(0) − nƒ(1) ≤ 1, 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.Dostępny również w formie drukowanej.KEYWORDS: totally magic cordial labeling, one-point union of graphs
Let G = (V, E) be a finite non-empty graph. A vertex-magic total labeling (VMTL) is a bijection lamb...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
Let f be a map from V (G) to {0, 1, ..., k − 1} where k is an integer, 1 ≤ k ≤ |V (G)|. For each edg...
A graph G is said to have a totally magic cordial (TMC) labeling with constant C if there exists a m...
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 totally magic labeling of 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...
A vertex magic labelling on 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...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
Let G = (V, E) be a finite non-empty graph. A vertex-magic total labeling (VMTL) is a bijection lamb...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
Let f be a map from V (G) to {0, 1, ..., k − 1} where k is an integer, 1 ≤ k ≤ |V (G)|. For each edg...
A graph G is said to have a totally magic cordial (TMC) labeling with constant C if there exists a m...
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 totally magic labeling of 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...
A vertex magic labelling on 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...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
Let G = (V, E) be a finite non-empty graph. A vertex-magic total labeling (VMTL) is a bijection lamb...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
Let f be a map from V (G) to {0, 1, ..., k − 1} where k is an integer, 1 ≤ k ≤ |V (G)|. For each edg...