Search
Now showing items 1-3 of 3
Super Antimagicness of a Well-defined Graph
(PMIPA FKIP Universitas Jember, 2012-06-01)
A graph G of order p and size q is called an (a, d)-edge-
antimagic total if there exist a bijection f : V (G)U E(G) --->
{1,2,3,4,5,...., p+ q} such that the edge-weights, w(uv) = f(u) +
f(v) + f(uv); uv in E(G), form ...
Vertex-magic total labeling of the union of suns
(Ars Combinatoria, 2012)
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 ...
Total Vertex Irregularity Strength of the Disjoint Union of Sun Graphs
(International Journal of Combinatorics, 2012)
A vertex irregular total $k$-labeling of a graph $G$ with vertex set $V$ and edge set $E$ is an assignment of positive integer labels $\{1,2,...,k\}$ to both vertices and edges so that the weights calculated at vertices ...