Search
Now showing items 21-25 of 25
On two conjectures concerning vertex magic total labelings of generalized Petersen graphs
(Bulletins of ICA, 2001)
A vertex-magic total labeling of a graph with $v$ vertices and $e$ edges is defined as a one-to-one map taking the vertices and edges onto the integers $1,2,\dots ,v+e$ with the property that the sum of the label on a ...
Edge-magic total labelings of wheels, fans and friendship graphs
(Bulletins of ICA, 2002)
An edge-magic total labeling on a graph with v vertices and e
edges will be defined as a one-to-one map taking the vertices and
edges onto the integers 1, 2, · · · , v+e with the property that the sum
of the label on ...
Diregularity of digraphs of out-degree three and order two less than Moore bound
(Proceeding of 12th Australasian Workshop on Combinatorial Algorithms, 2001)
It is easy to show that any digraph with out-degree at most $d \ge 2$, diameter $k \ge 2$ and order $n=d+d^2+\dots + d^k - 1$, that is, two less than Moore bound must have
all vertices of out-degree $d$. In other words, ...
Exclusive Sum Labeling of Graphs
(JCMCC, 2005)
On vertex-magic total labeling of some wheel related graphs
(Utilitas Math., 2007)
Let G be a graph with vertex set V = V (G) and edge set E =
E(G) and let e = jE(G)j and v = jV (G)j. A one-to-one map ¸ from
V [ E onto the integers f1; 2; : : : ; v + eg is called vertex-magic total
labeling if there ...