Browsing LECTURER SCIENTIFIC PUBLICATION (Publikasi Ilmiah) by Title

DSpace/Manakin Repository

Browsing LECTURER SCIENTIFIC PUBLICATION (Publikasi Ilmiah) by Title

Sort by: Order: Results:

  • Prihandoko, Antonius Cahya; Ghodosi, Hossein (2018-04-23)
    This research aims to construct a content distribution protocol that preserves the content provider’s security and users’ privacy. The protocol can improve Digital Rights Management (DRM) that is required to provide ...
  • Yuliani Setia Dewi (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 ...
  • L. Susilowati; M. I. Utoyo; Slamin, Slamin (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 =| ...
  • Susilowati, Liliek; Utoyo, Mohammad Imam; Slamin, Slamin (2017-11-30)
    Let be a connected graph with vertex set and , ,…, ⊆ . A representation of a vertex ∈) with respect to is an ordered m-tuple | , , , ,..., , where , is the distance between ...
  • Lin, Yuqing; Slamin; Miller, Mirka (Utilitas Math., 2003)
  • Lin, Y.; Slamin; Baca, M.; Miller, M. (Ars Combinatoria, 2004)
  • Dafik, Mirka Miller, Costas Iliopoulos and Zdenek Ryjacek (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 ...
  • Novi H. Bong; Yuqing Lin; Slamin, Slamin (2017-12-04)
    Distance-irregular labeling was introduced by Slamin, and in his paper he determined the distance-irregular labeling for cycles and wheels of length f0; 1; 2; 5g mod 8. In this paper, we complete his results for cycles and ...
  • Slamin, Slamin (2017-11-30)
    Motivated by definition of distance magic labelling, we introduce a new type of irregular labelling whose evaluation is based on the neighbourhood of a vertex. We define a distance irregular labelling on a ...
  • Tirta, I Made; Anggraeni, Dian; Pandutama, Martinus (2018-02-07)
    Regression analysis (statistical analmodelling) are among statistical methods which are frequently needed in analyzing quantitative data, especially to model relationship between response and explanatory variables. ...
  • Rinurwati, Rinurwati; Suprajitno, Herry; Slamin, Slamin (2017-12-04)
    Let G =(V(G),E(G)) be any connected graph of order n = |V(G)| and measure m = |E(G)|. For an order set of vertices S = { s 1 , s 2 , ..., s k } and a vertex v in G, the adjacency representation of v with respect to ...
  • Rinurwati; Slamin, Slamin; H. Suprajitno (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 ...
  • Wardani, Dwi Agustin Retno; Dafik, Dafik; Agustin, Ika Hesti; Kurniawati, Elsa Yuli (2018-02-28)
    An independent set or stable set is a set of vertices in a graph in which no two of vertices are adjacent. A set D of vertices of graph G is called a dominating set if every vertex u 2 V (G) ¡ D is adjacent to some vertex ...
  • Rinurwati, Rinurwati; Suprajitno, Herry; Slamin, Slamin (2017-11-30)
    This paper discusses some characterization and exact values for metric dimension of edge-corona from a connected graph not tree G with an arbitrary nontrivial graph H.
  • Agustin, Ika Hesti; Dafik, Dafik; Gembong A.W (2018-02-28)
    Let G = (V; E) be a simple, nontrivial, nite, connected and undirected graph. Let c be a coloring c : E(G) ! f1; 2; : : : ; sg; s 2 N. A path of edge colored graph is said to be a rainbow path if no two edges on the ...
  • Desy Tri Puspasari., Dafik., Slamin (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. ...
  • D.E.W. Meganingtyas, Dafik, Slamin (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 ...
  • N.I. Wulandari, I.H. Agustin, Dafik (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 ...
  • Agustin, Ika Hesti; Dafik, Dafik; A.Y. Harsya (2018-03-07)
    Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an r-dynamic k-coloring of graph G, we mean a proper k-coloring c(v) of G such that jc(N(v))j minfr; d(v)g for each vertex v in ...
  • Arika Indah Kristiana; Dafik (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 ...

Pencarian


Browse

My Account