Search
Now showing items 1-5 of 5
Open Problems in the Construction of Large Directed Graphs
(Proceedings of the sixteenth Australasian Workshop on Combinatorial Algoritms, 2005-09-15)
In this paper we consider the problem of how to construct directed graphs
with given maximum out-degree and diameter. To deal with this problem, we describe
several construction techniques. These fall into three broad ...
Conjectures and open problems on face antimagic evaluations of graphs
(Journal of Indonesian Mathematical Society, 2005)
(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 ...
Exclusive Sum Labeling of Graphs
(JCMCC, 2005)