# Browsing MIPA by Issue Date

Sort by: Order: Results:

• (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 ...
• (Discrete Mathematics, 2001)
A simple undirected graph H is called a sum graph if there is a labeling L of the vertices of H into distinct positive integers such that any two vertices u and v of H are adjacent if and only if there is a vertex w with ...
• (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, ...
• (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 ...
• (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 ...
• (Utilitas Math., 2003)
• (Discussiones Mathematicae Graph Theory, 2003)
In this paper we introduce a new type of graph labeling for a graph G(V;E) called an (a; d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V| + |E| ...
• (Ars Combinatoria, 2004)
• (JCMCC, 2005)
• (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 ...
• (JCMCC, 2005)
• (Journal of Indonesian Mathematical Society, 2005)
• (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 ...
• (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 ...
• (Kelompok Studi Lingkungan Indonsia, 2006)
• (Jurnal Kimia Lingkungan; Kelompok Studi Lingkungan Indonsia, 2006)
• (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) ...
• (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 ...
• (CIAO (Center for Informatics and Applied Optimisation), ITMS (School of Information Technology and Mathematical Science), University of Ballarat Australia., 2006-07-13)
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 an ...
• (Ars Combinatoria, 2007)