Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Entire DC Network
Strategies Community College Mexican American Adult College Algebra Students Use When Graphing Function Transformations, Roxana Pamela Jimenez
Strategies Community College Mexican American Adult College Algebra Students Use When Graphing Function Transformations, Roxana Pamela Jimenez
Theses and Dissertations
This qualitative case study pursued to describe the different strategies Mexican American adult students in a local community college used to graph function transformations. Participants in the study were purposefully selected using a criterion sampling to ensure participants were atypical, above average students between the ages 18-22, and had a final course average of 89.5-100 in College Algebra. Three research questions were examined 1) In what ways do Mexican American adult college students graph a function transformation? 2) Which strategies do students implement when graphing a function transformation? Qualitative research methods using think aloud semi-structured interviews were used in this …
Graph Homomorphisms And Vector Colorings, Michael Robert Levet
Graph Homomorphisms And Vector Colorings, Michael Robert Levet
Theses and Dissertations
A graph vertex coloring is an assignment of labels, which are referred to as colors, such that no two adjacent vertices receive the same color. The vertex coloring problem is NP-Complete [8], and so no polynomial time algorithm is believed to exist. The notion of a graph vector coloring was introduced as an efficiently computable relaxation to the graph vertex coloring problem [7]. In [6], the authors examined the highly symmetric class of 1-walk regular graphs, characterizing when such graphs admit unique vector colorings. We present this characterization, as well as several important consequences discussed in [5, 6]. By appealing …
P_4-Decomposability In Regular Graphs And Multigraphs, David Joshua Mendell
P_4-Decomposability In Regular Graphs And Multigraphs, David Joshua Mendell
Theses and Dissertations
The main objective of this thesis is to review and expand the study of graph decomposability. An H-decomposition of a graph G=(V,E) is a partitioning of the edge set, $E$, into edge-disjoint isomorphic copies of a subgraph H. In particular we focus on the decompositions of graphs into paths. We prove that a 2,4 mutligraph with maximum multiplicity 2 admits a C_2,C_3-free Euler tour (and thus, a decomposition into paths of length 3 if it has size a multiple of 3) if and only if it avoids a set of 15 forbidden structures. We also prove that …
The Minimum Rank Of Schemes On Graphs, William Nelson Sexton
The Minimum Rank Of Schemes On Graphs, William Nelson Sexton
Theses and Dissertations
Let G be an undirected graph on n vertices and let S(G) be the class of all real-valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let V = {1, 2, . . . , n} be the vertex set of G. A scheme on G is a function f : V → {0, 1}. Given a scheme f on G, there is an associated class of matrices Sf (G) = {A ∈ S(G)|aii = 0 if and only if f(i) = 0}. A scheme f is said …
Diagonal Entry Restrictions In Minimum Rank Matrices, And The Inverse Inertia And Eigenvalue Problems For Graphs, Curtis G. Nelson
Diagonal Entry Restrictions In Minimum Rank Matrices, And The Inverse Inertia And Eigenvalue Problems For Graphs, Curtis G. Nelson
Theses and Dissertations
Let F be a field, let G be an undirected graph on n vertices, and let SF(G) be the set of all F-valued symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let MRF(G) be defined as the set of matrices in SF(G) whose rank achieves the minimum of the ranks of matrices in SF(G). We develop techniques involving Z-hat, a process termed nil forcing, and induced subgraphs, that can determine when diagonal entries corresponding to specific vertices of G must be zero or nonzero for all matrices in …
The Minimum Rank, Inverse Inertia, And Inverse Eigenvalue Problems For Graphs, Mark Condie Kempton
The Minimum Rank, Inverse Inertia, And Inverse Eigenvalue Problems For Graphs, Mark Condie Kempton
Theses and Dissertations
For a graph G we define S(G) to be the set of all real symmetric n by n matrices whose off-diagonal zero/nonzero pattern is described by G. We show how to compute the minimum rank of all matrices in S(G) for a class of graphs called outerplanar graphs. In addition, we obtain results on the possible eigenvalues and possible inertias of matrices in S(G) for certain classes of graph G. We also obtain results concerning the relationship between two graph parameters, the zero forcing number and the path cover number, related to the minimum rank problem.
Maximal Surfaces In Complexes, Allen J. Dickson
Maximal Surfaces In Complexes, Allen J. Dickson
Theses and Dissertations
Cubical complexes are defined in a manner analogous to that for simplicial complexes, the chief difference being that cubical complexes are unions of cubes rather than of simplices. A very natural cubical complex to consider is the complex C(k_1,...,k_n) where k_1,...,k_n are nonnegative integers. This complex has as its underlying space [0,k_1]x...x[0,k_n] subset of R^n with vertices at all points having integer coordinates and higher dimensional cubes formed by the vertices in the natural way. The genus of a cubical complex is defined to be the maximum genus of all surfaces that are subcomplexes of the cubical complex. A formula …
Ultraconnected And Critical Graphs, Jason Nicholas Grout
Ultraconnected And Critical Graphs, Jason Nicholas Grout
Theses and Dissertations
We investigate the ultraconnectivity condition on graphs, and provide further connections between critical and ultraconnected graphs in the positive definite partial matrix completion problem. We completely characterize when the join of graphs is ultraconnected, and prove that ultraconnectivity is preserved by Cartesian products. We completely characterize when adding a vertex to an ultraconnected graph preserves ultraconnectivity. We also derive bounds on the number of vertices which guarantee ultraconnectivity of certain classes of regular graphs. We give results from our exhaustive enumeration of ultraconnected graphs up to 11 vertices. Using techniques involving the Lovász theta parameter for graphs, we prove certain …