Related papers: On partial endomorphisms of a star graph
We calculate the rank and idempotent rank of the semigroup $E(X,P)$ generated by the idempotents of the semigroup $T(X,P)$, which consists of all transformations of the finite set $X$ preserving a non-uniform partition $P$. We also classify…
We introduce the {\it endomorphism distinguishing number} $D_e(G)$ of a graph $G$ as the least cardinal $d$ such that $G$ has a vertex coloring with $d$ colors that is only preserved by the trivial endomorphism. This generalizes the notion…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
We consider three extremal problems about the number of copies of a fixed graph in another larger graph. First, we correct an error in a result of Reiher and Wagner and prove that the number of $k$-edge stars in a graph with density $x \in…
In the paper the notion of a star partial homeomorphism of a finite dimensional Euclidean space $\mathbb{R}^n$ is introduced. We describe the structure of the semigroup $\mathbf{PStH}_{\mathbb{R}^n}$ of star partial homeomorphisms of the…
This papers focuses on the average order of dominating sets of a graph. We find the extremal graphs for the maximum and minimum value over all graphs on $n$ vertices, while for trees we prove that the star minimizes the average order of…
We study tensor powers of representations of finite monoids, focusing on the growth behavior of their composition length and the number of indecomposable summands. Special attention is given to diagram monoids such as the Temperley-Lieb,…
This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
We prove properties of extremal graphs of girth 5 and order 20 <=v <= 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for…
We study congruences on the partial automorphism monoid of a finite rank free group action. We give a decomposition of a congruence on this monoid into a Rees congruence, a congruence on a Brandt semigroup and an idempotent separating…
The intersection graphs of stars in some tree are known as substar graphs. In this paper we give a characterization of substar graphs by the list of minimal forbidden induced subgraphs. This corrects a flaw in the main result of Chang,…
The primary objective of this paper is to investigate the notions of geometric and sequential convexity within a graph-theoretic framework, with the aim of examining various structural properties and exploring the connection between these…
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…
The main purpose of this paper is investigating classes of acts that are injective relative to all embeddings with indecomposable domains or codomains. We give some homological classifications of monoids in light of such kinds of…
We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…
We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.
This note gives generators and relations for the strict monoidal category of probabilistic maps on finite cardinals (i.e., stochastic matrices).
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…