Search
Now showing items 1-10 of 27
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 ...
On diregularity of digraphs of defect two
(The University of Newcastle Australia, 2007-11-05)
Since Moore digraphs do not exist for k /= 1 and d /= 1,
the problem of finding the existence of digraph of out-degree d >= 2
and diameter k >= 2 and order close to the Moore bound becomes an
interesting problem. To ...
Structural Properties and Labeling of Graphs
(School of Information Technology and Mathematical Sciences, University of Ballarat, 2007-11-25)
The complexity in building massive scale parallel
processing systems has re- sulted in a growing interest in the study
of interconnection networks design. Network design a®ects the
performance, cost, scalability, and ...
Kolorimetrik sampler pasif untuk gas NO2 menggunakan media kertas saring
(Kelompok Studi Lingkungan Indonsia, 2006)
Super Edge-antimagic Total Labeling of Disjoint Union of Triangular Ladder and Lobster Graphs
(Indoms Indonesian Mathematics Society, 2009-10-12)
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, .... , p + q} such that the edge-weights, w(uv) = f(u) +
f(v) + f(uv); uv in E(G), form ...
Aktivitas antimalaria ekstrak metanol dan fraksi kloroform buah Duranta repens L. pada mencit yang diinfeksi Plasmodium berghei
(Lembaga Penelitian Universitas Jember, 2009-06)
Malaria is one of the most prevalent infectious diseases in the tropical countries. The resistance of Plasmodium for many synthetic antmalarial drugs has encouraged the scientist to look for new drugs from the nature. ...
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 ...