Fakultas Matematika dan Ilmu Pengetahuan Alamhttp://repository.unej.ac.id/handle/123456789/108282019-08-25T14:49:02Z2019-08-25T14:49:02ZLESSON STUDY FOR LEARNING COMMUNITY : REVIEW HASIL SHORT TERM ON LESSON STUDY V DI JEPANGHobri, Hobrihttp://repository.unej.ac.id/handle/123456789/783392016-12-07T03:26:31Z2016-05-28T00:00:00ZLESSON STUDY FOR LEARNING COMMUNITY : REVIEW HASIL SHORT TERM ON LESSON STUDY V DI JEPANG
Hobri, Hobri
Lesson Study (LS) is already exist in Japan more than 100 years ago. Lesson study
is a professional development process that Japanese teachers engage in to systematically examine their practice, with the goal of becoming more effective. This examination centers on teachers wor12 | P a g e king collaboratively on a small number of "study lessons". Workingon these study lessons involves planning, teaching, observing, and critiquing the lessons. Among 30 years until now, is developed by Manabu Sato, et al, namely Lesson Study for Learning Community (LSLC). Practically, not only plan-do-see, but also involve collaborative learning, caring community, and jumping task. Through LSLC, it is possible to enhance the quality of interaction between students, teachers, principal, supervisor, and stakeholder. Generally, students learn in 4 aspects, that is: do (individual, and or group), (2) speak up, (3) ask/question/discussion, and (4) observe attentively.
This paper is the result of STOLS in Japan 2015
2016-05-28T00:00:00ZSuper (a,d)-$H$- antimagic total covering of connected amalgamation of fan graphSiti Latifah, Ika Hesti A., Dafikhttp://repository.unej.ac.id/handle/123456789/733342016-02-18T08:53:01Z2016-02-18T00:00:00ZSuper (a,d)-$H$- antimagic total covering of connected amalgamation of fan graph
Siti Latifah, Ika Hesti A., Dafik
Graph $G=(V,E)$ is a finite, simple and undirected.
Graph $G$ have $H'$ covering, if every edge in $E(G)$ belongs to at least
one subgraph of $G$ isomorphic to a given graph $H$. A graph $G$ is
said to be an $(a, d)$-$H$-antimagic total covering if there exist a
bijective function $f: V(G) \cup E(G) \rightarrow \{1, 2,\dots ,|V
(G)| + |E(G)|\}$ such that for all subgraphs $H'$ isomorphic to $H$,
the total $H$-weights $w(H)= \sum_{v\in V(H')}f(v)+\sum_{e\in
E(H')}f(v)$ form an arithmetic sequence $\{a, a + d, a +2d,...,a+(s
- 1)d\}$, where $a$ and $d$ are positive integers and $s$ is the
number of all subgraphs $H'$ isomorphic to $H$. Such a covering is
called super if $f: V(G) \rightarrow \{1, 2,\dots ,|V (G)|\}$. This paper will study the existence of super $(a, d)-H$- antimagic total covering of connected amalgamation of fan graph for feasible $d$.
2016-02-18T00:00:00ZPelabelan Total Super ($a,d$) - Face Antimagic dari Graf Shackle ($C_5,e,n$)Siska Binastuti., Dafik., Arif Fatahillahhttp://repository.unej.ac.id/handle/123456789/733332016-02-18T08:49:48Z2016-02-18T00:00:00ZPelabelan Total Super ($a,d$) - Face Antimagic dari Graf Shackle ($C_5,e,n$)
Siska Binastuti., Dafik., Arif Fatahillah
Let $G$ be a simple graph of order $p$, size $q$ and face $r$. The
graph $G$ is called a super ($a,d$) - face antimagic total labeling
, if there exist a bijection $f:V(G)\cup E(G)\cup F(G)$ $\rightarrow
\{1,2,...,p+q+r\}$ such that the set of $s$-sided face weights,
$W_{s} = \{a_{s},a_{s}+d,a_{s}+2d,...,a_{s}+(r_{s}-1)d\}$ form an
arithmetic sequence with first term $a$,common difference $d$, where
$a$ and $d$ are positive integers $s$ and $r_{s}$ is the number of
$s$-sided faces. Such a graph is called super if the smallest
possible labels appear on the vertices. The type of Face Antimagic
Labeling is (1,1,1). In this paper we will study a Super $(a,d)$ -
Face Antimagic of Shackle ($C_5,e,n$) Graph and we will use it to
develop a polyalphabetic chyptosystem.
2016-02-18T00:00:00ZSuper (a,d)-{H}-Antimagic Total Selimut pada Amalgamasi Graf Roda untuk Pengembangan Kriptosistem PolyalphabeticNovri Anggraeni., Dafik., Slaminhttp://repository.unej.ac.id/handle/123456789/733322016-02-18T08:46:03Z2016-02-18T00:00:00ZSuper (a,d)-{H}-Antimagic Total Selimut pada Amalgamasi Graf Roda untuk Pengembangan Kriptosistem Polyalphabetic
Novri Anggraeni., Dafik., Slamin
A graph $G(V,E)$ has a $\mathcal{H}$-covering if every
edge in $E$ belongs to a subgraph of $G$ isomorphic to
$\mathcal{H}$. An $(a,d)$-$\mathcal{H}$-antimagic total covering is
a total labeling $\lambda$ from $V(G)\cup E(G)$ onto the integers
$\{1,2,3,...,|V(G)\cup E(G)|\}$ with the property that, for every
subgraph $A$ of $G$ isomorphic to $\mathcal{H}$ the
$\sum{A}=\sum_{v\in{V(A)}}\lambda{(v)}+\sum_{e\in{E(A)}}\lambda{(e)}$
forms an arithmetic sequence. A graph that admits such a labeling is
called an $(a,d)$-$\mathcal{H}$-antimagic total covering. In
addition, if $\{\lambda{(v)}\}_{v\in{V}}=\{1,...,|V|\}$, then the
graph is called $\mathcal{H}$-super antimagic graph. In this paper
we study $\mathcal{H}$-covering of amalgamation of wheel graph and
also to develop polyalphabetic chiper of cryptosystem from a secret
massage.
2016-02-18T00:00:00Z