Sofia Burille is currently a rising senior pursuing a BS in mathematics on the Applied Track at Saint Mary’s College of California. Last summer her school awarded her funds to complete a research project on the graph parameters Tree Cover Number and Positive Semidefinite Zeroforcing Number. For her senior research project, she hopes to combine mathematical modeling with her knowledge of graph theory. Since her sophomore year she has been tutoring other undergraduates in lower-division mathematics. She enjoys playing volleyball, doing community service, meditating, going to beaches, and visiting her family in Brazil.
Project: Graph Edit Distance
Qualitative and quantitative similarities between any two given graphs aids in pattern recognition among graphs. My project consisted of finding a function to calculate the graph edit distance of any two given graphs; graph edit distance is the minimum number of graph edit operations (edge deletion, edge addition, vertex addition) to transform one graph into another. Two sequences of minimum distance transformations using different methods of calculating this distance are shown below.