211 research outputs found
The Effect of the Treffinger Learning Model on Mathematical Connection Ability Students Viewed from Mathematical Resilience
No full textTreffinger learning model is one of the learning models that can help students to think creatively and connect ideas between thoughts and provide opportunities for students to be able to show their abilities, such as mathematical connection abilities. Besides the learning model, there are internal factors that become factors to improve the students’ mathematical connection ability, one of which is mathematical resilience. Students with good resilience are students who tend not to give up easily and are certain or confident in solving problems in the questions. The research type a quasi-experimental research. The data analysis technique used was the two-way ANOVA with unbalanced cells and post hoc tests using the Scheffe method. The population in this study was 8th grade students of SMP in Karanganyar district. Based on the statistical analysis, (1) There is no difference in the effects between the learning models used on the mathematical connection ability; (2) There are differences in the effects between the mathematical resilience used on the mathematical connection ability; (3) There is no interaction between learning models and mathematical resilience to the mathematical connection ability
THE ECCENTRIC DIGRAPH OF FRIENDSHIP GRAPH, AND FIRECRACKER GRAPH
No full textLet G be a graph with a set of vertices V(G) and a set of edges E(G). The distance
from vertex u to vertex v in G, denoted by d(u,v), is a length of the shortest path from
vertex u to v. The eccentricity of vertex u in graph G is the maximum distance from
vertex u to any other vertices in G, denoted by e(u). Vertex v is an eccentric vertex from u
if d(u,v) = e(u). The eccentric digraph ED(G) of a graph G is a graph that has the same set
of vertices as G, and there is an arc (directed edge) joining vertex u to v if v is an
eccentric vertex from u.
The purposes of this reserarch are to determine the eccentric digraphs of some
classes of graphs, in particular the friendship graphs, and the firecracker graphs
MINIMAL EDGE DARI GRAF 2-CONNECTED DENGAN CIRCUMFERENCE TERTENTU (On Edge Minimal 2-Connected Graphs with Prescribed Circumference)
No full textMisal G adalah graf 2-connected dengan n vertex dan m edge yang mempunyai circumference c ≥.4. Dalam makalah ini ditentukan banyaknya minimum edge dari graf 2-connected G dengan n vertex dan m edge yang mempunyai circumference c ≥.4.
Kata kunci : circumference, graf 2-connecte
The Eccentric Digraph of a Lintang Graph
No full textLet G be a graph with a set of vertices V(G) and a set of edges E(G). The distance from vertex
u to vertex v in G, denoted by d(u,v), is a length of the shortest path from vertex u to v. The
eccentricity of vertex u in graph G is the maximum distance from vertex u to any other vertices in
G, denoted by e(u). Vertex v is an eccentric vertex from u if d(u,v) =e(u). The eccentric digraph
ED(G) of a graph G is a graph that has the same set of vertices as G, and there is an arc (directed
edge) joining vertex u to v if v is an eccentric vertex from u. Boland and Miller [1] introduced the
eccentric digraph of a digraph. They also proposed an open problem to find the eccentric digraph
of various classes of graphs. In this paper, we tackle this open problem for the class of lintang
graph.
Key words : eccentricity,eccentric digraph, lintang graph
THE ECCENTRIC DIGRAPH OF THE CORONA OF WITH , OR
No full textpdf abstractDOI : http://dx.doi.org/10.22342/jims.18.2.117.113-118</jats:p
- …
