Lights out puzzle: Number of solvable states of some classes of graphs
Date of Publication
2008
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics with Specialization in Computer Applications
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Defense Panel Chair
Leonora A. Ruivivar
Defense Panel Member
Isagani B. Jos
Sonia Y. Tan
Yvette F. Lim
Abstract/Summary
In this study, we expound on the proofs of the number of solvable states of special graphs known as path path of order and cycles cycle of order which are included in the paper of Lim and Gervacio entitled Lights Out Puzzle: Numbers of Solvable States of Graphs which appeared in the DLSU-Osaka Proceedings Volume 9. In addition, we have established the number of solvable states of special graphs such as fans fan of order, wheels wheel of order, complete bipartite complete graph where, and other graphs of the form join of the null graph of order n and a graph G.
Abstract Format
html
Language
English
Format
Accession Number
TU15424
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
vii, 107 leaves, illustrations, 28 cm.
Keywords
Finite groups; Solvable groups
Recommended Citation
Ngo, J. C., & Sabater, V. C. (2008). Lights out puzzle: Number of solvable states of some classes of graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/5056
Embargo Period
3-29-2021
