Algebra Commons^™

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. …

Categorical Aspects Of Graphs, Jacob D. Ender

Undergraduate Student Research Internships Conference

In this article, we introduce a categorical characterization of directed and undirected graphs, and explore subcategories of reflexive and simple graphs. We show that there are a number of adjunctions between such subcategories, exploring varying combinations of graph types.

On The Hamiltonicity Of Subgroup Lattices, Nicholas Charles Fleece

MSU Graduate Theses

In this paper we discuss the Hamiltonicity of the subgroup lattices of

different classes of groups. We provide sufficient conditions for the

Hamiltonicity of the subgroup lattices of cube-free abelian groups. We also

prove the non-Hamiltonicity of the subgroup lattices of dihedral and

dicyclic groups. We disprove a conjecture on non-abelian p-groups by

producing an infinite family of non-abelian p-groups with Hamiltonian

subgroup lattices. Finally, we provide a list of the Hamiltonicity of the

subgroup lattices of every finite group up to order 35 barring two groups.

Counting And Coloring Sudoku Graphs, Kyle Oddson

Mathematics and Statistics Dissertations, Theses, and Final Project Papers

A sudoku puzzle is most commonly a 9 × 9 grid of 3 × 3 boxes wherein the puzzle player writes the numbers 1 - 9 with no repetition in any row, column, or box. We generalize the notion of the n² × n² sudoku grid for all n ϵ Z ^≥2 and codify the empty sudoku board as a graph. In the main section of this paper we prove that sudoku boards and sudoku graphs exist for all such n we prove the equivalence of [3]'s construction using unions and products of graphs to the definition of …

Special Subset Vertex Multisubgraphs For Multi Networks, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors study special type of subset vertex multi subgraphs; these multi subgraphs can be directed or otherwise. Another special feature of these subset vertex multigraphs is that we are aware of the elements in each vertex set and how it affects the structure of both subset vertex multisubgraphs and edge multisubgraphs. It is pertinent to record at this juncture that certain ego centric directed multistar graphs become empty on the removal of one edge, there by theorising the importance, and giving certain postulates how to safely form ego centric multi networks. Given any subset vertex multigraph we …

New Trends In Neutrosophic Theory And Applications Volume Ii, Florentin Smarandache, Surapati Pramanik

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory was proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs introducing neutrosophic sets and its applications, …

Subset Vertex Graphs For Social Networks, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of subset vertex graph using the vertex set as the subset of the power set P(S), S is assumed in this book to be finite; however it can be finite or infinite. We have defined two types of subset vertex graphs, one is directed and the other one is not directed. The most important fact which must be kept in record is that for a given set of vertices there exists one and only one subset vertex graph be it of type I or type II. Several important and …

Math And Sudoku: Exploring Sudoku Boards Through Graph Theory, Group Theory, And Combinatorics, Kyle Oddson

Student Research Symposium

Encoding Sudoku puzzles as partially colored graphs, we state and prove Akman’s theorem [1] regarding the associated partial chromatic polynomial [5]; we count the 4x4 sudoku boards, in total and fundamentally distinct; we count the diagonally distinct 4x4 sudoku boards; and we classify and enumerate the different structure types of 4x4 boards.

The Automorphism Group Of The Halved Cube, Benjamin B. Mackinnon

Theses and Dissertations

An n-dimensional halved cube is a graph whose vertices are the binary strings of length n, where two vertices are adjacent if and only if they differ in exactly two positions. It can be regarded as the graph whose vertex set is one partite set of the n-dimensional hypercube, with an edge joining vertices at hamming distance two. In this thesis we compute the automorphism groups of the halved cubes by embedding them in R n and realizing the automorphism group as a subgroup of GLn(R). As an application we show that a halved cube is a circulant graph if …

Strong Neutrosophic Graphs And Subgraph Topological Subspaces, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilantheral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of strong neutrosophic graphs. They are very different from the usual graphs and neutrosophic graphs. Using these new structures special subgraph topological spaces are defined. Further special lattice graph of subgraphs of these graphs are defined and described. Several interesting properties using subgraphs of a strong neutrosophic graph are obtained. Several open conjectures are proposed. These new class of strong neutrosophic graphs will certainly find applications in NCMs, NRMs and NREs with appropriate modifications.

Neutrosophic Graphs: A New Dimension To Graph Theory, Florentin Smarandache, Wb. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time have made a through study of neutrosophic graphs. This study reveals that these neutrosophic graphs give a new dimension to graph theory. The important feature of this book is it contains over 200 neutrosophic graphs to provide better understanding of this concepts. Further these graphs happen to behave in a unique way inmost cases, for even the edge colouring problem is different from the classical one. Several directions and dimensions in graph theory are obtained from this study. Finally certainly these new notions of neutrosophic graphs in general and in particular the …

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

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 …

A Study Of Finite Symmetrical Groups, Patrick Kevin Martinez

Theses Digitization Project

This study discovered several important groups that involve the classical and sporadic groups. These groups appeared as finite homomorphic images of the progenitors 3*8 : PGL₂(7), 2*¹⁴ : L₃ (2), 5*³ : S₃ and 7*2 : m S₃.

Weierstrass Points On Families Of Graphs, William D. Lindsay Jr.

Master's Theses

No abstract provided.

Semigroup As Graphs, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors study the zero divisor graph and unit graph of a semigroup. The zero divisor graphs of semigroups Zn under multiplication is studied and characterized.

Solutions To The Chinese Postman Problem, Kenneth Peter Cramm

Theses Digitization Project

Considering the Chinese Postman Problem, in which a mailman must deliver mail to houses in a neighborhood. The mailman must cover each side of the street that has houses, at least once. The focus of this paper is our attempt to discover the optimal path, or the least number of times each street is walked. The integration of algorithms from graph theory and operations research form the method used to explain solutions to the Chinese Postman Problem.