Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Teaching Algebra: A Comparison Of Scottish And American Perspectives, Brittany Munro
Teaching Algebra: A Comparison Of Scottish And American Perspectives, Brittany Munro
Undergraduate Honors Theses
A variety of factors influence what teaching strategies an educator uses. I analyze survey responses from algebra teachers in Scotland and Appalachia America to discover how a teacher's perception of these factors, particularly their view of mathematics itself, determines the pedagogical strategies employed in the classroom.
Global Domination Stable Graphs, Elizabeth Marie Harris
Global Domination Stable Graphs, Elizabeth Marie Harris
Electronic Theses and Dissertations
A set of vertices S in a graph G is a global dominating set (GDS) of G if S is a dominating set for both G and its complement G. The minimum cardinality of a global dominating set of G is the global domination number of G. We explore the effects of graph modifications on the global domination number. In particular, we explore edge removal, edge addition, and vertex removal.
Mode Vertices And Mode Graphs., Jobriath Scott Kauffman
Mode Vertices And Mode Graphs., Jobriath Scott Kauffman
Electronic Theses and Dissertations
The eccentricity of a vertex, v, of a connected graph, G, is the distance to a furthest vertex from v. A mode vertex of a connected graph, G, is a vertex whose eccentricity occurs as often in the eccentricity sequence of G as the eccentricity of any other vertex. The mode of a graph, G, is the subgraph induced by the mode vertices of G. A mode graph is a connected graph for which each vertex is a mode vertex. Note that mode graphs are a generalization of self-centered graphs. This paper presents some …
Vertices In Total Dominating Sets., Robert Elmer Dautermann Iii
Vertices In Total Dominating Sets., Robert Elmer Dautermann Iii
Electronic Theses and Dissertations
Fricke, Haynes, Hedetniemi, Hedetniemi, and Laskar introduced the following concept. For a graph G = (V,E), let rho denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is called rho-excellent if every vertex in V is rho-good, rho-commendable if g > b > 0, rho-fair if g = b, and …