Search
Search Results
-
Bent and Near-Bent Function Construction and 2-Error-Correcting Codes
A function \(f: F_{2^m} \rightarrow F_{2^t}\) is called a...
-
On Decompositions of Complete 3-Uniform Hypergraphs into a Linear Forest with 4 Edges
A 3-uniform linear forest is any hypergraph obtained by starting with a single 3-uniform edge and adding other 3-uniform edges sequentially such that...
-
Nonexistence of a Subfamily of a Family of Edge-Regular Graphs
A simple, non-edgeless, regular graph is said to be edge-regular if the cardinality of the intersection of the neighborhoods of every pair of...
-
(2, 3)-Cordial Oriented Hypercubes
In this article we investigate the existence of (2, 3)-cordial labelings of oriented hypercubes. In this investigation, we determine that there...
-
A Go-Up Code Construction from Linear Codes Yielding Additive Codes for Quantum Stabilizer Codes
Given a code C over the finite field \(\mathbb {F}_q\) ,...
-
Graph Constructions Derived from Interconnection Networks
A class of interconnection networks for massively parallel processors are designed by taking copies of a building block network and wiring them...
-
Inverse of Hermitian Adjacency Matrix of Mixed Bipartite Graphs
Mixed graph D is a graph that can be obtained from a graph by orienting some of its edges. The Hermitian adjacency matrix of a mixed graph is defined...
-
Harmonious Colorings of Graphs
A harmonious labeling of a graph G of order n and size m is an injective function $$f:...
-
DNA Self-assembly: Complete Tripartite Graphs and Cocktail Party Graphs
Based on the tile method for DNA self-assembly, which involves branched junction molecules whose flexible k-arms are double strands of DNA, we design...
-
Cospanning Characterizations of Violator and Co-violator Spaces
Given a finite set E and an operator \(\sigma :2^{E}\longrightarrow 2^{E}\)...
-
Decomposition of the Johnson Graphs into Graph-Pairs of Order 4
A graph-pair of order t is a pair of graphs G and H on t non-isolated vertices for which...
-
Resolutions for an Infinite Family of Bose Triple Systems
A classical construction of Bose produces a Steiner triple system of order 3n from a symmetric, idempotent latin square of order n whenever n is odd....
-
(2, 3)-Cordial Trees and Paths
Recently L. B. Beasley introduced (2, 3)-cordial labelings of directed graphs in [1]. He conjectured that every orientation of a path of length at...
-
The Zero Forcing Span of a Graph
In zero forcing, the focus is typically on finding the minimum cardinality of any zero forcing set in the graph; however, the number of cardinalities...
-
The es-splitting Operation for Matroids Representable Over Prime Fields GF(p)
The es-splitting operation for binary matroids is a natural generalization of Slater’s n-line splitting operation on graphs. The present paper...
-
Differences of Functions with the Same Value Multiset
In a recent article, Ullman and Velleman studied functions a from an abelian group G to itself that can be expressed as a difference of two...
-
Combinatorics, Graph Theory and Computing SEICCGTC 2021, Boca Raton, USA, March 8–12
This proceedings volume convenes selected, revised papers presented at the 52nd Southeastern International Conference on Combinatorics, Graph Theory...
-
On a Convex Geometric Connection to Threshold Logic
A convex geometric connection to Threshold Logic will be reviewed. We have presented necessary and sufficient conditions to recognize cut-complexes...
-
Counting Vertices in Iterated Line Graphs
We introduce new methods of studying properties of iterated line graphs and demonstrate the use of these methods on a class of tree graphs. We also...
-
The Existence Problem for Strong Complete Map**s of Finite Groups
The Cayley table M and the normal multiplication table N of a finite group G are Latin squares. There exists a Latin square orthogonal to both M and...