Discrete Mathematics and Combinatorics Commons^™

Cycle Double Covers And Integer Flows, Zhang Zhang

Graduate Theses, Dissertations, and Problem Reports (ETD)

My research focuses on two famous problems in graph theory, namely the cycle double cover conjecture and the integer flows conjectures. This kind of problem is undoubtedly one of the major catalysts in the tremendous development of graph theory. It was observed by Tutte that the Four color problem can be formulated in terms of integer flows, as well as cycle covers. Since then, the topics of integer flows and cycle covers have always been in the main line of graph theory research. This dissertation provides several partial results on these two classes of problems.

Weighted Modulo Orientations Of Graphs, Jianbing Liu

Graduate Theses, Dissertations, and Problem Reports (ETD)

This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte's 5-Flow Conjecture (1954) states that every bridgeless graph admits a nowhere-zero 5-flow, and Tutte's 3-Flow Conjecture (1972) states that every 4-edge-connected graph admits a nowhere-zero 3-flow. Extending Tutte's flows conjectures, Jaeger's Circular Flow Conjecture (1981) says every 4k-edge-connected graph admits a modulo (2k+1)-orientation, that is, an orientation such that the indegree is congruent to outdegree modulo (2k+1) at every vertex. Note that the k=1 case of Circular Flow Conjecture coincides with the 3-Flow Conjecture, and the case of k=2 implies the 5-Flow Conjecture. This work is devoted …

Interval Valued Neutrosophic Shortest Path Problem By A* Algorithm, Florentin Smarandache, S. Khrisna Prabha, Said Broumi

Branch Mathematics and Statistics Faculty and Staff Publications

Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path …

The Subconstituent Algebra Of A Hypercube, Jared B. Billet

UNF Graduate Theses and Dissertations

We study the hypercube and the associated subconstituent algebra. Let Q_D denote the hypercube with dimension D and let X denote the vertex set of Q_D. Fix a vertex x in X. We denote by A the adjacency matrix of Q_D and by A* = A*(x) the diagonal matrix with yy-entry equal to D − 2i, where i is the distance between x and y. The subconstitutent algebra T = T(x) of Q_D with respect to x is generated by A and A* . We show that A 2A* − 2AA*A + A*A 2 = 4A* A*2A − 2A*AA* + …

Maximality And Applications Of Subword-Closed Languages, Rhys Davis Jones

UNF Graduate Theses and Dissertations

Characterizing languages D that are maximal with the property that D^* ⊆ S^⊗ is an important problem in formal language theory with applications to coding theory and DNA codewords. Given a finite set of words of a fixed length S, the constraint, we consider its subword closure, S^⊗, the set of words whose subwords of that fixed length are all in the constraint. We investigate these maximal languages and present characterizations for them. These characterizations use strongly connected components of deterministic finite automata and lead to polynomial time algorithms for generating such languages. We prove that …

Uniform Three-Class Regular Partial Steiner Triple Systems With Uniform Degrees, Prangya Rani Parida

Dissertations, Master's Theses and Master's Reports

A Partial Steiner Triple system (X, T) is a finite set of points C and a collection T of 3-element subsets of C that every pair of points intersect in at most 1 triple. A 3-class regular PSTS (3-PSTS) is a PSTS where the points can be partitioned into 3 classes (each class having size m, n and p respectively) such that no triple belongs to any class and any two points from the same class occur in the same number of triples (a, b and c respectively). The 3-PSTS is said to be uniform if m = n = …

An Exploration Of The Use Of The Fibonacci Sequence In Unrelated Mathematics Disciplines, Molly E. Boodey

Honors Theses and Capstones

No abstract provided.

Model Selection And Experimental Design Of Biological Networks With Algebraic Geometry, Anyu Zhang

Mathematics Theses and Dissertations

Model selection based on experimental data is an essential challenge in biological data science. In decades, the volume of biological data from varied sources, including laboratory experiments, field observations, and patient health records has seen an unprecedented increase. Mainly when collecting data is expensive or time-consuming, as it is often in the case with clinical trials and biomolecular experiments, the problem of selecting information-rich data becomes crucial for creating relevant models.

Motivated by certain geometric relationships between data, we partitioned input data sets, especially data sets that correspond to a unique basis, into equivalence classes with the same basis to …

Rearrangement Operations On Unrooted Phylogenetic Networks, Remie Janssen, Jonathan Klawitter

Theory & Applications of Graphs

Rearrangement operations transform a phylogenetic tree into another one and hence induce a metric on the space of phylogenetic trees. Popular operations for unrooted phylogenetic trees are NNI (nearest neighbour interchange), SPR (subtree prune and regraft), and TBR (tree bisection and reconnection). Recently, these operations have been extended to unrooted phylogenetic networks, which are generalisations of phylogenetic trees that can model reticulated evolutionary relationships. Here, we study global and local properties of spaces of phylogenetic networks under these three operations. In particular, we prove connectedness and asymptotic bounds on the diameters of spaces of different classes of phylogenetic networks, including …

Q-Sumudu Transforms Pertaining To The Product Of Family Of Q-Polynomials And Generalized Basic Hypergeometric Functions, V. K. Vyas, Ali A. Al –Jarrah, S. D. Purohit

Applications and Applied Mathematics: An International Journal (AAM)

The prime objective of commenced article is to determine q-Sumudu transforms of a product of unified family of q-polynomials with basic (or q-) analog of Fox’s H-function and q-analog of I-functions. Specialized cases of the leading outcome are further evaluated as q-Sumudu transform of general class of q-polynomials and q-Sumudu transforms of the basic analogs of Fox’s H-function and I-functions.

Adjoint Appell-Euler And First Kind Appell-Bernoulli Polynomials, Pierpaolo Natalini, Paolo E. Ricci

Applications and Applied Mathematics: An International Journal (AAM)

The adjunction property, recently introduced for Sheffer polynomial sets, is considered in the case of Appell polynomials. The particular case of adjoint Appell-Euler and Appell-Bernoulli polynomials of the first kind is analyzed.

Invariant Sum Defined In Terms Of Complex Multivariate Polynomial Given Degree, Matthew Niemiro '20

Exemplary Student Work

We use a generalized version of arithmetic progressions to obtain a non- trivial everywhere-zero sum in terms of a complex univariate polynomial and its degree. We then remark on its generalization to multivariate polynomials.

Adjacent Vertex-Distinguishing Proper Edge-Coloring Of Strong Product Of Graphs, S. Anantharaman

Applications and Applied Mathematics: An International Journal (AAM)

Let G be a finite, simple, undirected and connected graph. The adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for a proper edge-coloring of G, in which no two adjacent vertices are incident to edges colored with the same set of colors. The minimum number of colors required for an adjacent vertex-distinguishing proper edgecoloring of G is called the adjacent vertex-distinguishing proper edge-chromatic index. In this paper, I compute adjacent vertex-distinguishing proper edge-chromatic index of strong product of graphs.

Rank Reduction Of String C-Group Representations, Peter A. Brooksbank, Dimitri Leemans

Faculty Journal Articles

We show that a rank reduction technique for string C-group representations first used in [Adv. Math. 228 (2018), pp. 3207–3222] for the symmetric groups generalizes to arbitrary settings. The technique permits us, among other things, to prove that orthogonal groups defined on d-dimensional modules over fields of even order greater than 2 possess string C-group representations of all ranks. The broad applicability of the rank reduction technique provides fresh impetus to construct, for suitable families of groups, string C-groups of highest possible rank. It also suggests that the alternating group Alt(11)—the only known group having “rank gaps”—is perhaps more unusual …

The Weak Hyperedge Tenacity Of The Hypercycles, G. H. Shirdel, B. Vaez-Zadeh

Applications and Applied Mathematics: An International Journal (AAM)

Graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the tenacity is the best criteria for measuring it. Since the hypergraph generalize the standard graph by defining any edge between multiple vertices instead of only two vertices, the above question is about the hypergraph. When a …

Some Results And Examples On Vertex Equitable Labeling, Mohamed Saied Aboshady, Reda Amin Elbarkoki, Eliwa Mohamed Roshdy, Mohamed Abdel Azim Seoud

Basic Science Engineering

In this paper we present a survey for all graphs with order at most 6 whether they are vertex equitable or not and we get an upper bound for the number of edges of any graph with 𝑝 vertices to be a vertex equitable graph. Also, we establish vertex equitable labeling for the 𝑚-chain of the complete bipartite graph 𝐾2,𝑛 and for the graph 𝑃𝑛 × 𝑃𝑚.

Conditional Strong Matching Preclusion Of The Alternating Group Graph, Mohamad Abdallah, Eddie Cheng

Theory & Applications of Graphs

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. Park and Ihm introduced the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults. In this paper, we find the conditional strong matching preclusion number for the n-dimensional alternating group graph AG_n.

Repeat Length Of Patterns On Weaving Products, Zhuochen Liu

Mathematical Sciences Technical Reports (MSTR)

Interlacing strands have been used to create artistic weaving patterns. Repeated patterns form aesthetically pleasing products. This research is a mathematical modeling of weaving products in the real world by using Cellular Automata. The research is conducted by observing the evolution of the model to better understand products in the real world. Specifically, this research focuses on the repeat length of a weaving pattern given the rule of generating it and the configuration of the starting row. Previous studies have shown the range of the repeat length in specific situations. This paper will generalize the precise repeat length in one …

Forcibly-Biconnected Graphical Degree Sequences: Decision Algorithms And Enumerative Results, Kai Wang

Theory & Applications of Graphs

We present an algorithm to test whether a given graphical degree sequence is forcibly biconnected. The worst case time complexity of the algorithm is shown to be exponential but it is still much better than the previous basic algorithm for this problem. We show through experimental evaluations that the algorithm is efficient on average. We also adapt the classic algorithm of Ruskey et al. and that of Barnes and Savage to obtain some enumerative results about forcibly biconnected graphical degree sequences of given length n and forcibly biconnected graphical partitions of given even integer n. Based on these enumerative …

Laplacian Spectral Characterization Of Signed Sun Graphs, Fatemeh Motialah, Mohammad Hassan Shirdareh Haghighi

Theory & Applications of Graphs

A sun SG_n is a graph of order 2n consisting of a cycle C_n, n ≥ 3, to each vertex of it a pendant edge is attached. In this paper, we prove that unbalanced signed sun graphs are determined by their Laplacian spectra. Also we show that a balanced signed sun graph is determined by its Laplacian spectrum if and only if n is odd.

Sdrap: An Annotation Pipeline For Highly Scrambled Genomes, Jasper Braun

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Mathematical Models For Describing Molecular Self-Assembly, Margherita Maria Ferrari

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Loop Homology Of Bi-Secondary Structures, Andrei Bura

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Design Of Experiments For Unique Wiring Diagram Identification, Elena Dimitrova

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

On An Enhancement Of Rna Probing Data Using Information Theory, Thomas J.X. Li, Christian M. Reidys

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Research For Educators: Modeling Graph Theory For Nontraditional Math Researchers, Erwin Cornelius

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Controllability And Observability Of Linear Nabla Discrete Fractional Systems, Tilekbek Zhoroev

Masters Theses & Specialist Projects

The main purpose of this thesis to examine the controllability and observability of the linear discrete fractional systems. First we introduce the problem and continue with the review of some basic definitions and concepts of fractional calculus which are widely used to develop the theory of this subject. In Chapter 3, we give the unique solution of the fractional difference equation involving the Riemann-Liouville operator of real order between zero and one. Additionally we study the sequential fractional difference equations and describe the way to obtain the state-space repre- sentation of the sequential fractional difference equations. In Chapter 4, we …

Fractional Strong Matching Preclusion For Two Variants Of Hypercubes, Huifen Ge, Tianlong Ma, Miaolin Wu, Yuzhi Xiao

Theory & Applications of Graphs

Let F be a subset of edges and vertices of a graph G. If G-F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G. The fractional strong matching preclusion number is the cardinality of a minimum fractional strong matching preclusion set. In this paper, we mainly study the fractional strong matching preclusion problem for two variants of hypercubes, the multiply twisted cube and the locally twisted cube, which are two of the most popular interconnection networks. In addition, we classify all the optimal fractional strong matching preclusion set of each.

Colored Complete Hypergraphs Containing No Rainbow Berge Triangles, Colton Magnant

Theory & Applications of Graphs

The study of graph Ramsey numbers within restricted colorings, in particular forbidding a rainbow triangle, has recently been blossoming under the name Gallai-Ramsey numbers. In this work, we extend the main structural tool from rainbow triangle free colorings of complete graphs to rainbow Berge triangle free colorings of hypergraphs. In doing so, some other concepts and results are also translated from graphs to hypergraphs.

Roman Domination Cover Rubbling, Nicholas Carney

Electronic Theses and Dissertations

In this thesis, we introduce Roman domination cover rubbling as an extension of domination cover rubbling. We define a parameter on a graph $G$ called the \textit{Roman domination cover rubbling number}, denoted $\rho_{R}(G)$, as the smallest number of pebbles, so that from any initial configuration of those pebbles on $G$, it is possible to obtain a configuration which is Roman dominating after some sequence of pebbling and rubbling moves. We begin by characterizing graphs $G$ having small $\rho_{R}(G)$ value. Among other things, we also obtain the Roman domination cover rubbling number for paths and give an upper bound for the …