Related papers: Partial Cartesian Graph Product
A signed graph product is defined for a new product, and initially the unsigned graph product's Laplacian spectrum and signless Laplacian spectrum are found. Next, for the signed graph product, the adjacency spectrum, Laplacian spectrum,…
In this article we obtain classification results on the quasi-product production functions in terms of the geometry of their associated graph hypersurfaces, generalizing in a new setting some recent results concerning basic production…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
In this work, for a given inverse semigroup we will define the crossed product of an inverse semigroup by a partial action. Also, we will associate to an inverse semigroup $G$ an inverse semigroup $S_G$, and we will prove that there is a…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
Let G be a group and let P be a subsemigroup of G. In order to describe the crossed product of a C*-algebra A by an action of P by unital endomorphisms we find that we must extend the action to the whole group G. This extension fits into a…
Graph-based semantic representations are valuable in natural language processing, where it is often simple and effective to represent linguistic concepts as nodes, and relations as edges between them. Several attempts has been made to find…
In these notes, we define a new simplicial structure on a connected multiplicative operad and call it connected multiplicative simplicial operad (for short; simplicial operad). Next we introduce on this simplicial operad a brace algebra…
For compact sets $K\subset \mathbb C^{d}$, we introduce a subalgebra $A_{D}(K)$ of $A(K)$, which allows us to obtain Mergelyan type theorems for products of planar compact sets as well as for graphs of functions.
In this work we address graph based semi-supervised learning using the theory of the spatial segregation of competitive systems. First, we define a discrete counterpart over connected graphs by using direct analogue of the corresponding…
The purpose of this paper is to give a characterisation of divided power algebras over a reduced operad. Such a characterisation is given in terms of polynomial operations, following the classical example of divided power algebras. We…
In the present manuscript, we study analytic properties of zeta functions defined by partial Euler products.
Mathematica offers, by way of the package Combinatorics, many useful functions to work on graphs and ordered structures, but none of these functions was specific enough to meet the needs of our research group. Moreover, the existing…
Multiplication of a sparse matrix with another (dense or sparse) matrix is a fundamental operation that captures the computational patterns of many data science applications, including but not limited to graph algorithms, sparsely connected…
We classify crossed product gradings for arbitrary groups and fields up to several equivalence relations in terms of group actions and their orbits.
Computability relative to a partial function $f$ on the natural numbers can be formalized using the notion of an oracle for this function $f$. This can be generalized to arbitrary partial combinatory algebras, yielding a notion of…
A novel basis of discrete analytic polynomials on a rhombic lattice is introduced and the associated convolution product is studied. A class of discrete analytic functions that are rational with respect to this product is also described.
The K function and its related statistics have been an enduring tool in the analysis of spatial point processes, providing an easy to compute and interpret summary statistic for characterising the interactions between points of one type, or…
It is well-known that the tensor product of two bialgebras constitutes the binary product in the category of cocommutative bialgebras and morphisms of bialgebras between them. In this paper, we extend this result to triangular bialgebras…
We devise a new formulation for the vertex coloring problem. Different from other formulations, decision variables are associated with the pairs of vertices. Consequently, colors will be distinguishable. Although the objective function is…