In this paper, we study two questions related to the problem of testing whether a function is close to a homomorphism. For two finite groups (not necessarily Abelian), an arbitrary map , and a parameter , say that is -close to a homomorphism if there is some homomorphism such that and differ on at most elements of , and say that is -far otherwise. For a given and , a homomorphism tester should ...

In this paper, we investigate the generalized Hyers-Ulam-Rassias and the Isac and Rassias-type stability of the conditional of orthogonally ring $*$-$n$-derivation and orthogonally ring $*$-$n$-homomorphism on $C^*$-algebras. As a consequence of this, we prove the hyperstability of orthogonally ring $*$-$n$-derivation and orthogonally ring $*$-$n$-homomorphism on $C^*$-algebras.

For graphs G and H , a homomorphism from G to H is a function φ : V (G) → V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H . Many cases of graph homomorphism and locally injective graph homomorphism are NPcomplete, so there is little hope to design polynomial-time...

The oriented chromatic number of an oriented graph −→ G is the minimum order of an oriented graph −→ H such that −→ G admits a homomorphism to −→ H . The oriented chromatic number of an undirected graph G is then the greatest oriented chromatic number of its orientations. In this paper, we introduce the new notion of the upper oriented chromatic number of an undirected graph G, defined as the m...