This work provides a characterization of the learning of graph theory through the lens of the van Hiele model. For this purpose, we perform a theoretical analysis structured through the processes of reasoning that students activate when solving graph theory problems: recognition, use and formulation of definitions, classification, and proof. We thus obtain four levels of reasoning: an initial level of visual character in which students perceive graphs as a whole; a second level, analytical in nature in which students distinguish parts and properties of graphs; a pre-formal level in which students can interrelate properties; and a formal level in which graphs are handled as abstract mathematical objects. Our results, which are supported by a review of the literature on the teaching and learning of graph theory, might be very helpful to design efficient data collection instruments for empirical studies aiming to analyze students’ thinking in this field of mathematics.
28 January 2013 in Discrete Mathematics & Theoretical Computer Science
Graph Theory A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G is the minimum cardinality of a determining set of G. This paper studies the determining number of Kneser graphs. First, we compute the determining number of a wide range of Kneser graphs, concretely Kn:k with n≥k(k+1) / 2+1. In the language of group theory, these computations provide exact values for the base size of the symmetric group Sn acting on the k-subsets of 1,..., n. Then, we establish for which Kneser graphs Kn:k the determining number is equal to n-k, answering a question posed by Boutin. Finally, we find all Kneser graphs with fixed determining number 5, extending the study developed by Boutin for determining number 2, 3 or 4.
Determining vertex subsets are known tools to provide information about automorphism groups of graphs and, consequently about symmetries of graphs. In this paper, we provide both lower and upper bounds of the minimum size of such vertex subsets, called the determining number of the graph. These bounds, which are performed for arbitrary graphs, allow us to compute the determining number in two different graph families such are cographs and unit interval graphs.
6 May 2022 in Bulletin of the Malaysian Mathematical Sciences Society
A subset S of vertices of a connected graph G is a distance-equalizer set if for every two distinct vertices $$x, y \in V (G) {\setminus } S$$ there is a vertex $$w \in S$$ such that the distances from x and y to w are the same. The equidistant dimension of G is the minimum cardinality of a distance-equalizer set of G. This paper is devoted to introduce this parameter and explore its properties and applications to other mathematical problems, not necessarily in the context of graph theory. Concretely, we first establish some bounds concerning the order, the maximum degree, the clique number, and the independence number, and characterize all graphs attaining some extremal values. We then study the equidistant dimension of several families of graphs (complete and complete multipartite graphs, bistars, paths, cycles, and Johnson graphs), proving that, in the case of paths and cycles, this parameter is related to 3-AP-free sets. Subsequently, we show the usefulness of distance-equalizer sets for constructing doubly resolving sets.
1 September 2022 in Journal on Mathematics Education
The need to develop consistent theoretical frameworks for the teaching and learning of discrete mathematics, specifically of graph theory, has attracted the attention of the researchers in mathematics education. Responding to this demand, the scope of the Van Hiele model has been extended to the field of graphs through a proposal of four levels of reasoning whose descriptors need to be validated according to the structure of this model. In this paper, the validity of these descriptors has been approached with a theoretical analysis that is organized by means of the so-called processes of reasoning, which are different mathematics abilities that students activate when solving graph theory problems: recognition, use and formulation of definitions, classification, and proof. The analysis gives support to the internal validity of the levels of reasoning in graph theory as the properties of the Van Hiele levels have been verified: fixed sequence, adjacency, distinction, and separation. Moreover, the external validity of the levels has been supported by providing evidence of their coherence with the levels of geometrical reasoning from which they originally emerge. The results thus point to the suitability of applying the Van Hiele model in the teaching and learning of graph theory.
12 October 2022 in International Journal of Mathematical Education in Science and Technology
This work is devoted to exploring proof abilities in Graph Theory of undergraduate students of the Degree in Computer Engineering and Technology of the University of Seville. To do this, we have designed a questionnaire consisting of five open-ended items that serve as instrument to collect data concerning their proof skills when dealing with graphs. We have thus analysed them adapting the methodology for computing the degrees of acquisition of the Van Hiele levels. Our analysis leads to different proof profiles of Graph Theory students whose characteristics provide empirical support to consider proof levels in Graph Theory from the perspective of the Van Hiele model.