Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
A Study Of Graphical Permutations, Jessica Thune
A Study Of Graphical Permutations, Jessica Thune
UNLV Theses, Dissertations, Professional Papers, and Capstones
A permutation π on a set of positive integers {a_1,a_2,...,a_n} is said to be graphical if there exists a graph containing exactly a_i vertices of degree (a_i) for each i. It has been shown that for positive integers with a_1
Graph Theoretic Methods For The Analysis Of Data In Developing Systems, Kris H. Green, Bernard P. Ricca
Graph Theoretic Methods For The Analysis Of Data In Developing Systems, Kris H. Green, Bernard P. Ricca
Mathematical and Computing Sciences Faculty/Staff Publications
A full examination of learning or developing systems requires data analysis approaches beyond the commonplace pre-/post-testing. Drawing on graph theory, three particular approaches to the analysis of data—based on adjacency matrices, affiliation networks, and edit distances—can provide additional insight into data; these methods are applied to student performance in a Calculus course. Data analysis methods based on adjacency matrices demonstrate that learning is not unidimensional, that learning progressions do not always progress monotonically toward desired understandings and also provide insight into the connection between instruction and student learning. The use of affiliation networks supports the concept development theory of Lev …
Properties Of Small Ordered Graphs Whose Vertices Are Weighted By Their Degree, Constance M. Blalock
Properties Of Small Ordered Graphs Whose Vertices Are Weighted By Their Degree, Constance M. Blalock
Electronic Theses and Dissertations
Graphs can effectively model biomolecules, computer systems, and other applications. A weighted graph is a graph in which values or labels are assigned to the edges of the graph. However, in this thesis, we assign values to the vertices of the graph rather than the edges and we modify several standard graphical measures to incorporate these vertex weights. In particular, we designate the degree of each vertex as its weight. Previous research has not investigated weighting vertices by degree. We find the vertex weighted domination number in connected graphs, beginning with trees, and we define how weighted vertices can affect …
Bipartitions Based On Degree Constraints, Pamela I. Delgado
Bipartitions Based On Degree Constraints, Pamela I. Delgado
Electronic Theses and Dissertations
For a graph G = (V,E), we consider a bipartition {V1,V2} of the vertex set V by placing constraints on the vertices as follows. For every vertex v in Vi, we place a constraint on the number of neighbors v has in Vi and a constraint on the number of neighbors it has in V3-i. Using three values, namely 0 (no neighbors are allowed), 1 (at least one neighbor is required), and X (any number of neighbors are allowed) for each of the four constraints, results in 27 distinct types of …
Construction Algorithms For Expander Graphs, Vlad S. Burca
Construction Algorithms For Expander Graphs, Vlad S. Burca
Senior Theses and Projects
Graphs are mathematical objects that are comprised of nodes and edges that connect them. In computer science they are used to model concepts that exhibit network behaviors, such as social networks, communication paths or computer networks. In practice, it is desired that these graphs retain two main properties: sparseness and high connectivity. This is equivalent to having relatively short distances between two nodes but with an overall small number of edges. These graphs are called expander graphs and the main motivation behind studying them is the efficient network structure that they can produce due to their properties. We are specifically …
Pseudo Lattice Graphs And Their Applications To Fuzzy And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Pseudo Lattice Graphs And Their Applications To Fuzzy And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book for the first time authors introduce the concept of merged lattice, which gives a lattice or a graph. The resultant lattice or graph is defined as the pseudo lattice graph of type I. Here we also merge a graph with a lattice or two or more graphs which call as the pseudo lattice graph of type II. We merge either edges or vertices or both of a lattice and a graph or a lattice and a lattice or graph with itself. Such study is innovative and these mergings are adopted on all fuzzy and neutrosophic models which …