相关论文: Properties of the Generalized Zig-Zag Product of G…
In this paper, we investigate the ideals of semidirect products of L-algebras and the structure of simple L-algebras. We provide a precise characterization of the ideals of semidirect products and describe the structure of their prime…
This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…
We prove that the category of abstract Cuntz semigroups is bicomplete. As a consequence, the category admits products and ultraproducts. We further show that the scaled Cuntz semigroup of the (ultra)product of a family of C*-algebras agrees…
In this paper we present the super connectivity of Kronecker product of a general graph and a complete graph.
Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…
We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.
We give a geometric method for determining the cohomology groups of a polyhedral product under suitable freeness conditions or with coefficients taken in a field. This is done by considering first the special case for which the pairs of…
The packing number of a graph $G$ is the maximum number of closed neighborhoods of vertices in $G$ with pairwise empty intersections. Similarly, the open packing number of $G$ is the maximum number of open neighborhoods in $G$ with pairwise…
In this paper, we have studied the loops which are the semidirect products of a loop and a group. Also, the cummutant, nuclei and the center of such loops are studied.
We construct homology theories with coefficients in L-spectra on the category of ball complexes and we define products in this setting. We also obtain signatures of geometric situations in these homology groups and prove product formulae…
This paper studies the Laplacian spectral characterization of some graph products. We consider a class of connected graphs: $\mathscr{G}={G : |EG|\leq|VG|+1}$, and characterize all graphs $G\in\mathscr{G}$ such that the products $G\times…
For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…
In this paper we study a new product of graphs called {\em tight product}. A graph $H$ is said to be a tight product of two (undirected multi) graphs $G_1$ and $G_2$, if $V(H)=V(G_1)\times V(G_2)$ and both projection maps $V(H)\to V(G_1)$…
We develop a theory of twisted actions of categorical groups using a notion of semidirect product of categories. We work through numerous examples to demonstrate the power of these notions. Turning to representations, which are actions that…
We define the type of graph products, which enable us to treat many graph products in a unified manner. These unified graph products are shown to be compatible with Godsil--McKay switching. Furthermore, by this compatibility, we show that…
A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…
Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these…
A graph is said to be a cover graph if it is the underlying graph of the Hasse diagram of a finite partially ordered set. The direct product G X H of graphs G and H is the graph having vertex set V(G) X V(H) and edge set E(G X H) =…
The notion of quasicrossed product is introduced in the setting of G-graded quasialgebras, i.e., algebras endowed with a grading by a group G, satisfying a "quasiassociative" law. The equivalence between quasicrossed products and…