Related papers: Network right * abundant semigroups
An enumeration is given of certain equivalence classes of directed multigraphs having 0 to 5 nodes with each node having 2 incoming and 2 outgoing arcs.
The enhanced power graph $\mathcal G_e(\mathbf G)$ of a group $\mathbf G$ is the graph with vertex set $G$ such that two vertices $x$ and $y$ are adjacent if they are contained in a same cyclic subgroup. We prove that finite groups with…
Recently it has been noticed that many interesting combinatorial objects belong to a class of semigroups called left regular bands, and that random walks on these semigroups encode several well-known random walks. For example, the set of…
A connected dominating set (CDS) in a graph is a dominating set of vertices that induces a connected subgraph. Having many disjoint CDSs in a graph can be considered as a measure of its connectivity, and has various graph-theoretic and…
Multiplex networks are complex graph structures in which a set of entities are connected to each other via multiple types of relations, each relation representing a distinct layer. Such graphs are used to investigate many complex…
We show that for any discrete semigroup $X$ the semigroup operation can be extended to a right-topological semigroup operation on the space $G(X)$ of inclusion hyperspaces on $X$. We detect some important subsemigroups of $G(X)$, study the…
Complex network formalism allows to explain the behavior of systems composed by interacting units. Several prototypical network models have been proposed thus far. The small-world model has been introduced to mimic two important features…
We initiate the study of the internal structure of C*-algebras associated to a left cancellative semigroup in which any two principal right ideals are either disjoint or intersect in another principal right ideal; these are variously called…
We introduce a bivariant version of the Cuntz semigroup as equivalence classes of order zero maps generalizing the ordinary Cuntz semigroup. The theory has many properties formally analogous to KK-theory including a composition product. We…
A weakly U abundant is a class of semigroups characterized using some generalized Green' relations. In this paper we discuss the variants of weakly U - abundant semigroups and it is shown that the idempotent variants of these semigroups are…
In this paper, we study the $C$-width of HNN extension of a group via its proper isomorphic subgroups and amalgamated free product of two groups via their proper isomorphic subgroups with respect to conjugation invariant generating set. We…
Modularity is one of the most prominent properties of real-world complex networks. Here, we address the issue of module identification in two important classes of networks: bipartite networks and directed unipartite networks. Nodes in…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
In this note we start the study of whether the reduced C*-algebra of an inverse semigroup is quasi-diagonal, making explicit use of the inner structure of this class of semigroups in order to produce quasi-diagonal approximations. Given a…
DRC-semigroups model associative systems with domain and range operations, and contain many important classes, such as inverse, restriction, Ehresmann, regular $*$-, and $*$-regular semigroups. In this paper we show that the category of…
Group equivariant neural networks have been explored in the past few years and are interesting from theoretical and practical standpoints. They leverage concepts from group representation theory, non-commutative harmonic analysis and…
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here a model…
Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…
We extend the merging model for undirected networks by Kim et al. [Eur. Phys. J. B 43, 369 (2004)] to directed networks and investigate the emerging scale-free networks. Two versions of the directed merging model, friendly and hostile…
Congruences on a graph inverse semigroup were recently described in terms of the underline graph. Based on such descriptions, we show that the lattice of congruences on a graph inverse semigroup is upper semimodular but not lower…