Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Harmonious Labelings Via Cosets And Subcosets, Jared L. Painter, Holleigh C. Landers, Walker M. Mattox
Harmonious Labelings Via Cosets And Subcosets, Jared L. Painter, Holleigh C. Landers, Walker M. Mattox
Theory and Applications of Graphs
In [Abueida, A. and Roblee, K., More harmonious labelings of families of disjoint unions of an odd cycle and certain trees, J. Combin. Math. Combin. Comput., 115 (2020), 61-68] it is shown that the disjoint union of an odd cycle and certain paths is harmonious, and that certain starlike trees are harmonious using properties of cosets for a particular subgroup of the integers modulo m, where m is the number of edges of the graph. We expand upon these results by first exploring the numerical properties when adding values from cosets and subcosets in the integers modulo m. …
How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli
How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli
The Review: A Journal of Undergraduate Student Research
The art gallery problem is a geometry question that seeks to find the minimum number of guards necessary to guard an art gallery based on the qualities of the museum’s shape, specifically the number of walls. Solved by Václav Chvátal in 1975, the resulting Art Gallery Theorem dictates that ⌊n/3⌋ guards are always sufficient and sometimes necessary to guard an art gallery with n walls. This theorem, along with the argument that proves it, are accessible and interesting results even to one with little to no mathematical knowledge, introducing readers to common concepts in both geometry and graph …
Intersection Cographs And Aesthetics, Robert Haas
Intersection Cographs And Aesthetics, Robert Haas
Journal of Humanistic Mathematics
Cographs are complete graphs with colored lines (edges); in an intersection cograph, the points (vertices) and lines (edges) are labeled by sets, and the line between each pair of points is (or represents) their intersection. This article first presents the elementary theory of intersection cographs: 15 are possible on 4 points; constraints on the triangles and quadrilaterals; some forbidden configurations; and how, under suitable constraints, to generate the points from the lines alone. The mathematical theory is then applied to aesthetics, using set cographs to describe the experience of a person enjoying a picture (Mu Qi), poem (Dickinson), play (Shakespeare), …