Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Sayan Panma"'
Autor:
Nuttawoot Nupo, Sayan Panma
Publikováno v:
AIMS Mathematics, Vol 8, Iss 7, Pp 16228-16239 (2023)
An element $ x $ in a semigroup is said to be regular if there exists an element $ y $ in the semigroup such that $ x = xyx $. The element $ y $ is said to be a regular part of $ x $. Define the Cayley regularity graph of a semigroup $ S $ to be a di
Externí odkaz:
https://doaj.org/article/3d75860fe14546f08bbc6490d0cac91e
Autor:
Krittawit Limkul, Sayan Panma
Publikováno v:
Mathematics, Vol 11, Iss 16, p 3445 (2023)
Let S be a Clifford semigroup and A a subset of S. We write Cay(S,A) for the Cayley digraph of a Clifford semigroup S relative to A. The (weak, path, weak path) independence number of a graph is the maximum cardinality of an (weakly, path, weakly pat
Externí odkaz:
https://doaj.org/article/c1c5512226904d0a85af3d1bbf66822a
Publikováno v:
Journal of Mathematics, Vol 2023 (2023)
Let G and H be graphs. A mapping f from VG to VH is called a weak homomorphism from G to H if fx=fy or fx,fy∈EH whenever x,y∈EG. A ladder graph is the Cartesian product of two paths, where one of the paths has only one edge. A stacked prism graph
Externí odkaz:
https://doaj.org/article/9c6c615b6df34319bf3f3f14c83c2060
Publikováno v:
Journal of Mathematics, Vol 2023 (2023)
Let G be a graph with V=VG. A nonempty subset S of V is called an independent set of G if no two distinct vertices in S are adjacent. The union of a class {S:S is an independent set of G} and ∅ is denoted by IG. For a graph H, a function f:V⟶IH i
Externí odkaz:
https://doaj.org/article/2937a9905bfe4485aae4d19cd005a101
Publikováno v:
Mathematics, Vol 11, Iss 11, p 2587 (2023)
Let G and H be graphs. A mapping f from the vertices of G to the vertices of H is known as a homomorphism from G to H if, for every pair of adjacent vertices x and y in G, the vertices f(x) and f(y) are adjacent in H. A rectangular grid graph is the
Externí odkaz:
https://doaj.org/article/4f911ab7317b403b943e1ab3d300dbf4
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
Let G and H be graphs. A mapping f from VG to VH is called a weak homomorphism from G to H if fx=fy or fx,fy∈EH whenever x,y∈EG. In this paper, we provide an algorithm to determine the number of weak homomorphisms of paths.
Externí odkaz:
https://doaj.org/article/6369607f1f0c485d8a285bf78ccc7015
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
A set S of vertices of a graph G is a dominating set of G if every vertex in VG is adjacent to some vertex in S. A minimum dominating set in a graph G is a dominating set of minimum cardinality. The cardinality of a minimum dominating set is called t
Externí odkaz:
https://doaj.org/article/6f9c09b59af54eb9afd05fe72958b7e9
Publikováno v:
Mathematics, Vol 6, Iss 5, p 76 (2018)
Let K n be a complete graph on n vertices. Denote by S K n the set of all subgraphs of K n . For each G , H ∈ S K n , the ring sum of G and H is a graph whose vertex set is V ( G ) ∪ V ( H ) and whose edges are that of either G or H, but not of b
Externí odkaz:
https://doaj.org/article/a157a4d7c2da4b67a42ae6452374b0ba
Publikováno v:
Mathematics; Volume 11; Issue 11; Pages: 2587
Let G and H be graphs. A mapping f from the vertices of G to the vertices of H is known as a homomorphism from G to H if, for every pair of adjacent vertices x and y in G, the vertices f(x) and f(y) are adjacent in H. A rectangular grid graph is the
Autor:
Teerapong Suksumran, Sayan Panma
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing. 32:135-146
Let M be a left module over a ring R with identity and let $$\beta $$ be a skew-symmetric R-bilinear form on M. The generalized Heisenberg group consists of the set $$M\times M\times R = \{(x, y, t):x, y\in M, t\in R\}$$ with group law $$\begin{align