Search
Now showing items 1-10 of 18
Vertex-magic total labelings of disconnected graphs
(Journal of Prime Research in Mathematics, 2006)
Let $G$ be a graph with vertex set $V=V(G)$ and edge set $E=E(G)$ and
let $e=\vert E(G) \vert$ and $v=\vert V(G) \vert$.
A one-to-one map $\lambda$ from $V\cup E$ onto the integers
$\{ 1,2, ..., v+e \}$ is called {\it ...
Most wheel related graphs are not vertex magic
(Utilitas Math., 2008)
Suppose $G$ is a finite graph with vertex-set $V(G)$ and edge-set $E(G)$. A one-to-one map $\lambda$ from $V(G)\cup E(G)$ onto the integers $1,2,3, \dots, |V(G)|+|E(G)|$ is called a {\it vertex-magic total labeling}, if ...
On super edge-magic total labeling of banana trees
(Utilitas Math., 2009)
Let G1;G2;...;Gn be a family of disjoint stars. The tree obtained by joining a new vertex a to one pendant vertex of each star is called a banana tree. In this paper we consider the super edge magic total labeling of banana ...
On the partition dimension and connected partition dimension of wheels
(Ars Combinatoria, 2007)
Conjectures and open problems on face antimagic evaluations of graphs
(Journal of Indonesian Mathematical Society, 2005)
On the degrees of a strongly vertex-magic graph
(Discrete Mathematics, 2006)
Let G=(V ,E) be a finite graph, where |V |=n2 and |E|=e1.A vertex-magic total labeling is a bijection from V ∪E to the set of consecutive integers {1, 2, . . . , n + e} with the property that for every v ∈ V , (v) +w∈N(v) ...
(a,d)-Edge-Antimagic Total Labelings of Caterpillars
(Lecture Notes in Computer Science, 2005)
For a graph G = (V,E), a bijection g from V(G) ∪ E(G) into { 1,2, ..., ∣ V(G) ∣ + ∣ E(G) ∣ } is called (a,d)-edge-antimagic total labeling of G if the edge-weights w(xy) = g(x) + g(y) + g(xy), xy ∈ E(G), form an arithmetic ...
Bounds on the number of isolates in sum graph labeling
(Discrete Mathematics, 2001)
A simple undirected graph H is called a sum graph if there is a labeling L of the vertices
of H into distinct positive integers such that any two vertices u and v of H are adjacent if and only if there is a vertex w with ...
On d-antimagic labelings of prisms
(Ars Combinatoria, 2004)