# Browsing LECTURER SCIENTIFIC PUBLICATION (Publikasi Ilmiah) by Title

Sort by: Order: Results:

• (2014-04-10)
Correlation between predictor variables (multicollinearity) become a problem in regression analysis. There are some methods to solve the problem and each method has its own complexity. This research aims to know ...
• (2017-09-11)
Let G be a connected graph with vertex set ( )GV and =W {}( )....,,, GVwww 21 m ⊂ The representation of a vertex ( ),GVv ∈ with respect to W is the ordered m-tuple ( ) ( )( ,, () ( )),,...,,, 2 m wvdWvr =| ...
• (Utilitas Math., 2003)
• (Ars Combinatoria, 2004)
• (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 ...
• (2017-09-11)
An ordered set of vertices S is called as a (local) resolving set of a connected graph ),( EVG if for any two adjacent vertices GG Content from this work may be used under the terms of the Creative Commons Attribution ...
• (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. ...
• (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 ...
• (2016-02-02)
Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural number. 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 ...
• (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 ...
• (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 ...
• (2017-09-11)
The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with n+1 2 edges admits an edge decomposition G = H has i edges and is isomorphic to a subgraph of H i+1 1 ⊕· · · ⊕H , i = 1, ...
• (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) ...
• (2017-03-23)
Generalized AMMI (GAMMI) model has been widely used to model the Genotype × Environment Interaction (GEI) with categorical (or in general, non-normal) response variables. It was developed by introduce the concept of ...
• (2016-02-02)
A set $D$ of vertices of a simple graph $G$, that is a graph without loops and multiple edges, is called a dominating set if every vertex $u\in V(G)-D$ is adjacent to some vertex $v\in D$. The domination number of a ...
• (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 ...
• (Ars Combinatoria, 2007)
• (2013-10-08)
Reliability and accuracy of un-computerized direct shear apparatus which is manually in both test running and data acquisition were observed. Step by step of the direct shear test was examined closely to investigate the ...
• (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 ...
• (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 ...