Related papers: Bases and Structure Constants of Generalized Splin…
We investigate generalized inverses of matrices associated with two classes of digraphs: double star digraphs and D-linked stars digraphs. For double star digraphs, we determine the Drazin index and derive explicit formulas for the Drazin…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
This survey gives an overview of three central algebraic themes related to the study of splines: duality, group actions, and homology. Splines are piecewise polynomial functions of a prescribed order of smoothness on some subdivided domain…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
Strongly $\mathbb{Z}$-graded algebras or principal circle bundles and associated line bundles or invertible bimodules over a class of generalized Weyl algebras $\mathcal{B}(p;q, 0)$ (over a ring of polynomials in one variable) are…
A doubly group-labeled graph is an oriented graph with its edges labeled by elements of the direct sum of two groups $\Gamma_1,\Gamma_2$. A cycle in a doubly group-labeled graph is $(\Gamma_1,\Gamma_2)$-non-zero if it is non-zero in both…
This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…
We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…
We point out that any stable generalized complex structure on a sphere bundle over a closed surface of genus at least two must be of constant type.
A generalized top-spin analysis proposed some time ago in the context of Standard Model and subsequently studied in varying contexts is now applied primarily to the case of $e^+e^-\rightarrow t\bar{t}$ with transversely polarized beams.…
A simple and connected $n$-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers $1, 2, 3,\ldots, n$, such that adjacent vertices have relatively prime labels. We will present previously…
The basis number of a graph $G$ is the minimum $k$ such that the cycle space of $G$ is generated by a family of cycles using each edge at most $k$ times. A classical result of Mac Lane states that planar graphs are exactly graphs with basis…
In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…
This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…
In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic…
Universal cycles, such as De Bruijn cycles, are cyclic sequences of symbols that represent every combinatorial object from some family exactly once as a consecutive subsequence. Graph universal cycles are a graph analogue of universal…
A hypergraph is linear if each pair of distinct vertices appears in at most one common edge. We say $\varGamma=(V,E)$ is an associated graph of a linear hypergraph $\mathcal{H}=(V, X)$ if for any $x\in X$, the induced subgraph…
A graph $G$ is said to be chordal if it has no induced cycles of length four or more. In a recent preprint Culbertson, Guralnik, and Stiller give a new characterization of chordal graphs in terms of sequences of what they call…
Methods of constructing trigonometric fundamental splines with constant sign and sign-changing convergence factors are given. An example and graphics illustrating the concepts of convergence and interpolation grids are given. Some methods…