• School Mathematics
• /
• v.7 no.4
• /
• pp.353-373
• /
• 2005

The purpose of this paper is to analysis the basic network problem which can be applied to the mathematically gifted students in elementary school. Mainly, we discuss didactic transpositions of the double counting principle, the game of sprouts, Eulerian graph problem, and the minimum connector problem. Here the double counting principle is related to the handshaking lemma; in any graph, the sum of all the vertex-degree is equal to the number of edges. The selection of these subjects are based on the viewpoint; to familiar to graph theory, to raise algorithmic thinking, to apply to the real-world problem. The theoretical background of didactic transpositions of these subjects are based on the Polya's mathematical heuristics and Lakatos's philosophy of mathematics; quasi-empirical, proofs and refutations as a logic of mathematical discovery.