Now showing items 1-20 of 60

• #### A Study of Multigrid Methods with Application to Convection-Diffusion Problems ﻿

(UMIST (the University of Manchester Institute of Science and Technology), U.K., 1998-04-15)
The work accomplished in this dissertation is concerned with the numerical solution of linear elliptic partial differential equations in two dimensions, in particular modeling diffusion and convection-diffusion. The ...
• #### 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, ...
• #### 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 ...
• #### On d-antimagic labelings of antiprisms ﻿

(Utilitas Math., 2003)
• #### On d-antimagic labelings of prisms ﻿

(Ars Combinatoria, 2004)
• #### 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 ...
• #### Total Vertex Irregular Labeling of Complete Bipartite Graphs ﻿

(JCMCC, 2005)
• #### 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 ...
• #### 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 ...
• #### Kolorimetrik sampler pasif untuk gas NO2 menggunakan media kertas saring ﻿

(Kelompok Studi Lingkungan Indonsia, 2006)
• #### On the degrees of a strongly vertex-magic graph ﻿

(Discrete Mathematics, 2006)
Let G=(V ,E) be a finite graph, where |V |=n�2 and |E|=e�1.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) ...
• #### Pemanfaatan paralel port mikrokomputer untuk pengukuran simultan empat parameter kualitas air ﻿

(Jurnal Kimia Lingkungan; Kelompok Studi Lingkungan Indonsia, 2006)
• #### Electropolymerisation and Characterisation of Doped-Polypyrrole as Humidity Sensor ﻿

(Indonesian Journal of Chemistry, 2006-07)
A new type of sensing materials for humidity measurement has been developed based on conducting polymer polypyrrole synthesised from pyrrole by adding some dopant compounds, bromide and chloride, it is prepared by ...
• #### 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 ...
• #### On the partition dimension and connected partition dimension of wheels ﻿

(Ars Combinatoria, 2007)
• #### 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 ...
• #### 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 ...
• #### Vertex magic total labeling of unions of generalized Petersen graphs and unions of special circulant graphs ﻿

(JCMCC, 2009)