• Tidak ada hasil yang ditemukan

Menampilkan Bidang Diagonal Kubus dengan Geogebra Mathematics

N/A
N/A
Info
Unduh - Bebas
Protected

Academic year: 2017

Membagikan "Menampilkan Bidang Diagonal Kubus dengan Geogebra Mathematics"

Copied!
7
0
0

Memuat.... (Lihat teks lengkap sekarang)

Unduh sekarang ( 7 Halaman )

Teks penuh

(1)

Mathematics

SMP Negeri 2 Purworejo

2012/2013

Written by :

Almaas Salmaa L ( 01 )

Dewo Aji N ( 07 )

Dimas Ihza M ( 09)

Novi Anggia ( 17 )

Novika Amalia W ( 19 )

(2)

Cuboid is a solid shape formed by three pairs of

congruent rectangle

Edge is the faces of cuboids cross at a line Vertex is the edges of cuboids meet at a point

Face is the area that confined the inner parts and the

outer parts

Face diagonal is the a segment that connecting two

vertices facing each other on a face of the cubes or cuboids

Space diagonal is the line segment that conneting

two vertices each of which is in the top face and base face that is not it one face

Diagonal plane is the plane that formed by two face

(3)

 Elements of Cuboid

 Edge

(4)
(5)
(6)

 Face Diagonal

(7)

Referensi

Unduh sekarang ( DOCX - 7 Halaman - 372.30 KB )

Dokumen terkait

DISINI s1s2011

The ant’s path is equal to five edges of the cube (the portions at the bottom and top of the front face together make up one edge), so the total length in cm is 5 × 12 = 60..

DISINI 2015PascalSolution

In each drawing, we call each point a vertex (points are vertices ), each line or curve joining two vertices an edge , and the number of edges meeting at each vertex the degree of

getdoc2d57. 227KB Jun 04 2011 12:04:12 AM

In an n by n complete bipartite graph with independent exponentially distributed edge costs, we ask for the minimum total cost of a set of edges of which each vertex is incident to

A Beginner's Guide to Finite Mathematics

A simple walk that contains every edge of a given multigraph will be called an Euler walk in the multigraph; if an Euler walk starts and finish at the same vertex, it is called an Euler

Graph Terminology and Special Types of Graphs Discrete Mathematics

Definition: In-Degree and Out-Degree Definition In a graph with directed edges thein-degreeof a vertex v, denoted by deg−v, is the number of edges with v as their terminal vertex..

PDF Bipartite Graphs Discrete Mathematics

Definition: Bipartite Graphs Definition A simple graph G is calledbipartiteif its vertex set V can be partitioned into two disjoint sets V1 andV2 such that every edge in the graph

Representing Graphs Discrete Mathematics II

Representing Graphs by Adjacency Lists An other way to represent a graph without multiple edges is to use adjacency lists, which specify the vertices that are adjacent to each vertex

Chapter 13 Graphs and Traversals

Each edge object has pointers to its two end vertices and each vertex object has pointers to the two parts of its adjacency list, which store references to incident edges, one part for