Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication Year
- Publication
-
- Applications and Applied Mathematics: An International Journal (AAM) (3)
- Rose-Hulman Undergraduate Mathematics Journal (3)
- LSU Doctoral Dissertations (2)
- MSU Graduate Theses (2)
- All Graduate Plan B and other Reports, Spring 1920 to Spring 2023 (1)
-
- All Theses (1)
- Branch Mathematics and Statistics Faculty and Staff Publications (1)
- Dissertations, Theses, and Capstone Projects (1)
- HMC Senior Theses (1)
- Honors College Theses (1)
- Seaver College Research And Scholarly Achievement Symposium (1)
- Senior Independent Study Theses (1)
- Theory and Applications of Graphs (1)
- Theses and Dissertations (Comprehensive) (1)
- Publication Type
Articles 1 - 20 of 20
Full-Text Articles in Physical Sciences and Mathematics
Some Generalizations Of Corona Product Of Two Graphs, Aparajita Borah, Gajendra Pratap Singh
Some Generalizations Of Corona Product Of Two Graphs, Aparajita Borah, Gajendra Pratap Singh
Applications and Applied Mathematics: An International Journal (AAM)
In this paper we are seeking to conceptualize the notion of corona product of two graphs to contrive some special types of graphs. That is, here our attempt is to regenerate a familiar graph as a product graph. We are considering seven familiar graphs here to reconstruct them with the help of corona product of two graphs. Such types of families of the graphs and operations can be used to study biological pathways as well as to find the optimal order and size for the special types of graphs.
Structure Of A Total Independent Set, Lewis Stanton
Structure Of A Total Independent Set, Lewis Stanton
Rose-Hulman Undergraduate Mathematics Journal
Let $G$ be a simple, connected and finite graph with order $n$. Denote the independence number, edge independence number and total independence number by $\alpha(G), \alpha'(G)$ and $\alpha''(G)$ respectively. This paper establishes an upper bound for $\alpha''(G)$ in terms of $\alpha(G)$, $\alpha'(G)$ and $n$. We also describe the possible structures for a total independent set containing a given number of elements.
Cohen-Macaulay Properties Of Closed Neighborhood Ideals, Jackson Leaman
Cohen-Macaulay Properties Of Closed Neighborhood Ideals, Jackson Leaman
All Theses
This thesis investigates Cohen-Macaulay properties of squarefree monomial ideals, which is an important line of inquiry in the field of combinatorial commutative algebra. A famous example of this is Villareal’s edge ideal [11]: given a finite simple graph G with vertices x1, . . . , xn, the edge ideal of G is generated by all the monomials of the form xixj where xi and xj are adjacent in G. Villareal’s characterization of Cohen-Macaulay edge ideals associated to trees is an often-cited result in the literature. This was extended to chordal and bipartite graphs by Herzog, Hibi, and Zheng in …
Matroid Generalizations Of Some Graph Results, Cameron Crenshaw
Matroid Generalizations Of Some Graph Results, Cameron Crenshaw
LSU Doctoral Dissertations
The edges of a graph have natural cyclic orderings. We investigate the matroids for which a similar cyclic ordering of the circuits is possible. A full characterization of the non-binary matroids with this property is given. Evidence of the difficulty of this problem for binary matroids is presented, along with a partial result for binary orderable matroids.
For a graph G, the ratio of |E(G)| to the minimum degree of G has a natural lower bound. For a matroid M that is representable over a finite field, we generalize this to a lower bound on …
Opposite Trees, Theo Goossens
Opposite Trees, Theo Goossens
Theses and Dissertations (Comprehensive)
A spanning tree of a graph G is a connected acyclic subgraph of G that includes all of the vertices in G. The degree of a vertex is the number of edges incident to that vertex. Given a spanning tree T of a graph G, an opposite tree of T is a spanning tree of G where the degree of each of its vertices is different from its degree in T. For complete, complete bipartite, and complete multipartite graphs, we give the conditions spanning trees of these graphs must satisfy in order to have an opposite tree.
Quantum Dimension Polynomials: A Networked-Numbers Game Approach, Nicholas Gaubatz
Quantum Dimension Polynomials: A Networked-Numbers Game Approach, Nicholas Gaubatz
Honors College Theses
The Networked-Numbers Game--a mathematical "game'' played on a simple graph--is incredibly accessible and yet surprisingly rich in content. The Game is known to contain deep connections to the finite-dimensional simple Lie algebras over the complex numbers. On the other hand, Quantum Dimension Polynomials (QDPs)--enumerative expressions traditionally understood through root systems--corresponding to the above Lie algebras are complicated to derive and often inaccessible to undergraduates. In this thesis, the Networked-Numbers Game is defined and some known properties are presented. Next, the significance of the QDPs as a method to count combinatorially interesting structures is relayed. Ultimately, a novel closed-form expression of …
On The Hamiltonicity Of Subgroup Lattices, Nicholas Charles Fleece
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.
Exponents Of Jacobians Of Graphs And Regular Matroids, Hahn Lheem, Deyuan Li, Carl Joshua Quines, Jessica Zhang
Exponents Of Jacobians Of Graphs And Regular Matroids, Hahn Lheem, Deyuan Li, Carl Joshua Quines, Jessica Zhang
Rose-Hulman Undergraduate Mathematics Journal
Let G be a finite undirected multigraph with no self-loops. The Jacobian Jac (G) is a finite abelian group associated with G whose cardinality is equal to the number of spanning trees of G. There are only a finite number of biconnected graphs G such that the exponent of Jac (G) equals 2 or 3. The definition of a Jacobian can also be extended to regular matroids as a generalization of graphs. We prove that there are finitely many connected regular matroids M such that Jac (M) has exponent 2 and characterize all such matroids.
Logarithmic Mean Labeling Of Some Ladder Related Graphs, A. Durai Baskar
Logarithmic Mean Labeling Of Some Ladder Related Graphs, A. Durai Baskar
Applications and Applied Mathematics: An International Journal (AAM)
In general, the logarithmic mean of two positive integers need not be an integer. Hence, the logarithmic mean is to be an integer; we use either flooring or ceiling function. The logarithmic mean labeling of graphs have been defined in which the edge labels may be assigned by either flooring function or ceiling function. In this, we establish the logarithmic mean labeling on graphs by considering the edge labels obtained only from the flooring function. A logarithmic mean labeling of a graph G with q edges is an injective function from the vertex set of G to 1, 2, 3,..., …
The Game Of Cops And Robbers On Planar Graphs, Jordon S. Daugherty
The Game Of Cops And Robbers On Planar Graphs, Jordon S. Daugherty
MSU Graduate Theses
In graph theory, the game of cops and robbers is played on a finite, connected graph. The players take turns moving along edges as the cops try to capture the robber and the robber tries to evade capture forever. This game has received quite a bit of recent attention including several conjectures that have yet to be proven. In this paper, we restricted our attention to planar graphs in order to try to prove the conjecture that the dodecahedron graph is the smallest planar graph, in terms of vertices, that has cop number three. Along the way we discuss several …
Consecutive Prime And Highly Total Prime Labeling In Graphs, Robert Scholle
Consecutive Prime And Highly Total Prime Labeling In Graphs, Robert Scholle
Rose-Hulman Undergraduate Mathematics Journal
This paper examines the graph-theoretical concepts of consecutive prime labeling and highly total prime labeling. These are variations on prime labeling, introduced by Tout, Dabboucy, and Howalla in 1982. Consecutive prime labeling is defined here for the first time. Consecutive prime labeling requires that the labels of vertices in a graph be relatively prime to the labels of all adjacent vertices as well as all incident edges. We show that all paths, cycles, stars, and complete graphs have a consecutive prime labeling and conjecture that all simple connected graphs have a consecutive prime labeling.
This paper also expands on work …
A Mathematical Analysis Of The Game Of Santorini, Carson Clyde Geissler
A Mathematical Analysis Of The Game Of Santorini, Carson Clyde Geissler
Senior Independent Study Theses
Santorini is a two player combinatorial board game. Santorini bears resemblance to the graph theory game of Geography, a game of moving and deleting vertices on a graph. We explore Santorini with game theory, complexity theory, and artificial intelligence. We present David Lichtenstein’s proof that Geography is PSPACE-hard and adapt the proof for generalized forms of Santorini. Last, we discuss the development of an AI built for a software implementation of Santorini and present a number of improvements to that AI.
The Knill Graph Dimension From Clique Cover, Evatt Salinger, Dr. Kassahun Betre
The Knill Graph Dimension From Clique Cover, Evatt Salinger, Dr. Kassahun Betre
Seaver College Research And Scholarly Achievement Symposium
In this paper we prove that the recursive (Knill) dimension of the join of two graphs has a simple formula in terms of the dimensions of the component graphs: dim (G1 + G2) = 1 + dim G1 + dim G2. We use this formula to derive an expression for the Knill dimension of a graph from its minimum clique cover. A corollary of the formula is that a graph made of the arbitrary union of complete graphs KN of the same order KN will have dimension N − 1.
Finite Simple Graphs And Their Associated Graph Lattices, James B. Hart, Brian Frazier
Finite Simple Graphs And Their Associated Graph Lattices, James B. Hart, Brian Frazier
Theory and Applications of Graphs
In his 2005 dissertation, Antoine Vella explored combinatorical aspects of finite graphs utilizing a topological space whose open sets are intimately tied to the structure of the graph. In this paper, we go a step further and examine some aspects of the open set lattices induced by these topological spaces. In particular, we will characterize all lattices that constitute the opens for finite simple graphs endowed with this topology, explore the structure of these lattices, and show that these lattices contain information necessary to reconstruct the graph and its complement in several ways.
Unavoidable Immersions And Intertwines Of Graphs, Matthew Christopher Barnes
Unavoidable Immersions And Intertwines Of Graphs, Matthew Christopher Barnes
LSU Doctoral Dissertations
The topological minor and the minor relations are well-studied binary relations on the class of graphs. A natural weakening of the topological minor relation is an immersion. An immersion of a graph H into a graph G is a map that injects the vertex set of H into the vertex set of G such that edges between vertices of H are represented by pairwise-edge-disjoint paths of G. In this dissertation, we present two results: the first giving a set of unavoidable immersions of large 3-edge-connected graphs and the second on immersion intertwines of infinite graphs. These results, along with …
On Some Geometry Of Graphs, Zachary S. Mcguirk
On Some Geometry Of Graphs, Zachary S. Mcguirk
Dissertations, Theses, and Capstone Projects
In this thesis we study the intrinsic geometry of graphs via the constants that appear in discretized partial differential equations associated to those graphs. By studying the behavior of a discretized version of Bochner's inequality for smooth manifolds at the cone point for a cone over the set of vertices of a graph, a lower bound for the internal energy of the underlying graph is obtained. This gives a new lower bound for the size of the first non-trivial eigenvalue of the graph Laplacian in terms of the curvature constant that appears at the cone point and the size of …
Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore
Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore
All Graduate Plan B and other Reports, Spring 1920 to Spring 2023
Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log2(α)3 + 16.5log2(α)2 + …
Classifying The Jacobian Groups Of Adinkras, Aaron R. Bagheri
Classifying The Jacobian Groups Of Adinkras, Aaron R. Bagheri
HMC Senior Theses
Supersymmetry is a theoretical model of particle physics that posits a symmetry between bosons and fermions. Supersymmetry proposes the existence of particles that we have not yet observed and through them, offers a more unified view of the universe. In the same way Feynman Diagrams represent Feynman Integrals describing subatomic particle behaviour, supersymmetry algebras can be represented by graphs called adinkras. In addition to being motivated by physics, these graphs are highly structured and mathematically interesting. No one has looked at the Jacobians of these graphs before, so we attempt to characterize them in this thesis. We compute Jacobians through …
Independent Domination In Some Wheel Related Graphs, S. K. Vaidya, R. M. Pandit
Independent Domination In Some Wheel Related Graphs, S. K. Vaidya, R. M. Pandit
Applications and Applied Mathematics: An International Journal (AAM)
A set S of vertices in a graph G is called an independent dominating set if S is both independent and dominating. The independent domination number of G is the minimum cardinality of an independent dominating set in G . In this paper, we investigate the exact value of independent domination number for some wheel related graphs.
Neutrosophic Graphs: A New Dimension To Graph Theory, Florentin Smarandache, Wb. Vasantha Kandasamy, K. Ilanthenral
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 …