Browsing MIPA by Title
Now showing items 32-51 of 81
-
On $r$-Dynamic Coloring for Operation Product of Cycle and Cycle Graphs
(2016-02-18)For integer $k,r>0,(k,r)$ -coloring of graph $G$ is a proper coloring on the vertices of $G$ by $k$-colors such that every vertex $v$ of degree $d(v)$ is adjacent to vertices with at least $min\{d(v),r\}$ different color. ... -
On $r$-Dynamic Coloring of Operation Product of Cycle and Path Graphs
(2016-02-18)Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural numbers. By a proper $k$-coloring of a graph $G$, we mean a map $ c : V (G) \rightarrow S$, where $|S| =k$, Such that any two adjacent vertices ... -
On d-antimagic labelings of antiprisms
(Utilitas Math., 2003) -
On d-antimagic labelings of prisms
(Ars Combinatoria, 2004) -
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-antimagicness of connected generalized shackle of cycle with two chords
(2015-06-01)Let $G$ be a simple graph of order $p$ and size $q$. The graph $G$ is called an {\it $(a,d)$-edge-antimagic total graph} if there exist a bijection $f : V(G)\cup E(G) \to \{1,2,\dots,p+q\}$ such that the edge-weight ... -
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 ... -
On the degrees of a strongly vertex-magic graph
(Discrete Mathematics, 2006)Let G=(V ,E) be a finite graph, where |V |=n2 and |E|=e1.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) +w∈N(v) ... -
On the Existence of Non-Diregular Digraphs of Order Two less than the Moore Bound
(Jurnal Ilmu Dasar, 2011-01)A communication network can be modelled as a graph or a directed graph, where each processing element is represented by a vertex and the connection between two processing elements is represented by an edge (or, in case of ... -
On the partition dimension and connected partition dimension of wheels
(Ars Combinatoria, 2007) -
On Total Vertex Irregularity Strength Cocktail Party Graphs
(Jurnal Ilmu Dasar, 2011-01)A vertex irregular total k-labeling of a graph G is a function λ from both the vertex and the edge sets to {1,2,3,,k} such that for every pair of distinct vertices u and x, λ(u)+ Σλ(uv) ≠ λ(x)+ Σλ(xy). The integer k is ... -
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 ... -
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 ... -
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 ... -
Pelabelan Total Super $(a,d)$-Sisi Antimagic pada Graf Shackle Fan Berorder 5
(2016-02-18)et $G$ be a simple graph of order $p$ and size $q$. The graph $G$ is called an {\it $(a,d)$-edge-antimagic total graph} if there exist a bijection $f : V(G)\cup E(G) \to \{1,2,\dots,p+q\}$ such that the edge-weights, ... -
Pelabelan Total Super $(a,d)$-sisi Antimagic pada Gabungan Saling Lepas Graf Daun $mLg_n$
(Prosiding Seminar Nasional UAD, 2014-12-27)Pelabelan total super $(a,d)$-sisi antimagic pada sebuah graf $G=(V,E)$ adalah pelabelan titik dengan bilangan bulat $f(V)=\{1,2,3,...,p\}$ dan pelabelan sisi dengan bilangan bulat $f(E)=\{p+1,p+2,p+3,...p+q\}$ dari ... -
Pelabelan Total Super $(a,d)$-sisi Antimagic pada Gabungan Saling Lepas Graf Semi Parasut $mSP_{2n-1}$
(2015-02-11)Misalkan graf $G = (V,E)$ adalah graf sederhana, terhubung dan tidak berarah, dimana $V$ merupakan himpunan titik dan $E$ merupakan himpunan sisi. Graf $G$ dengan order $p$ dan size $q$ dikatakan $pelabelan$ $total$ ... -
Pemanfaatan paralel port mikrokomputer untuk pengukuran simultan empat parameter kualitas air
(Jurnal Kimia Lingkungan; Kelompok Studi Lingkungan Indonsia, 2006) -
Pemrograman Terstruktur
(2014-10-16)