EXAMPLES OF USING GRAPHS IN SOLVING MATHEMATICAL AND LOGICAL PROBLEMS IN 5-6 CLASSES
DOI:
https://doi.org/10.31110/2616-650X-vol11i9-011Keywords:
graph, algorithm, math, logic, Computer ScienceAbstract
Graph theory is a branch of mathematics that lies at the intersection of algebra, geometry, combinatorics, and a number of other mathematical disciplines and uses their methods to solve both mathematical problems and programming problems, problems of information theory, physics, etc. In recent years, at school mathematical competitions, Olympiads, and tournaments, there occur problems that can be solved by means of graph theory, in addition, such problems can be found also at computer science Olympiads. In the school mathematics course, graphs and their properties are not studied, however, they can be studied and used to solve problems in mathematics electives, in mathematics circles, in logic lessons. The article considers the use of some methods and algorithms of graph theory to solve mathematical and logical problems at school, which, according to the authors, can be offered to schoolchildren of grades 5-6. The authors consider route construction problems, problems using weighted graphs, procedures of Kruskal's algorithm, Prim's algorithm, problems solved using a greedy algorithm, problems of analysis of obtained solutions using Prim's algorithm, problems using properties of chains and cycles, problems solved using the handshake lemma. For teachers, the necessary theoretical information on graph theory, which was used in solving problems, is given. The article provides a brief historical overview of the development of graph theory. The proposed problems have simple solutions and can be used in logic lessons, optional mathematics classes for schoolchildren of grades 5-6. It is advisable to consider problems in the solution of which graphs are used in computer science classes to introduce students to one of the powerful mathematical tools for solving problems. Such lessons can become integrated from the point of view of an interdisciplinary approach, and the teacher in the lesson will implement interdisciplinary integration, which is relevant in modern conditions.
References
Anderson I. A First Course in Discrete Mathematics. Springer Verlag. 2002, 200 p. URL: http://www.fen.bilkent.edu.tr/~franz/dm/DM1.pdf
Карнаух Т. О., Ставровський А. Б. Теорія графів у задачах. К. : КНУ, 2012. 90 с.
Скляр І. В. Теорія графів у школі : задачі : посібник. К. : Шкільний світ, 2010. 128 с.
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Ольга Яковлєва, Юлія Банна

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
- Authors grant the journal a right of the first publication of the work under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0)that allows others freely to use (read, copy and print) submissions, search content and link to published articles, disseminate their full text and use them for any legitimate non-commercial purposes (i.e. educational or scientific) with the mandatory reference to the article’s authors and initial publication in this journal.
- Original published articles cannot be used by users (exept authors) for commercial purposes or distributed by third-party intermediary organizations for a fee.


