Results 31 to 40 of about 176 (112)
, 2013 In this paper we define a new monoid construction under crossed products for given monoids. We also present a generating set and a relator set for this product. Finally, we give the necessary and sufficient conditions for the regularity of it. MSC: 05C10,
Cangül, İ. N. +3 more
core +1 more source
Finite groups whose intersection power graphs are toroidal and projective-planar
Open Mathematics, 2021 The intersection power graph of a finite group GG is the graph whose vertex set is GG, and two distinct vertices xx and yy are adjacent if either one of xx and yy is the identity element of GG, or ⟨x⟩∩⟨y⟩\langle x\rangle \cap \langle y\rangle is non ...
Li Huani, Ma Xuanlong, Fu Ruiqin
doaj +1 more source
Distinguishing Cartesian Products of Countable Graphs
Discussiones Mathematicae Graph Theory, 2017 The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +1 more source
Open MathematicsLet SS be a semigroup. In this study, we first introduce the Green’s digraphs and Green’s graphs related to the Green’s relations L{\mathscr{L}}, R{\mathscr{R}}, and J{\mathscr{J}} of SS.
Cheng Yanliang, Shao Yong, Ma Xuanlong
doaj +1 more source
Journal of Applied Mathematics, Volume 2026, Issue 1, 2026.Among the diverse types of graph products, the double join and double corona operations have remained central to many recent developments in graph theory, offering fresh insights and problem‐solving strategies. Subdivision graphs, in particular, serve as an essential tool for examining how structural modifications along edges influence the overall ...
M. Vimal +3 more
wiley +1 more source
On finite presentability of direct products of semigroups
, 2000 A finite semigroup S is said to preserve finite generation (resp., presentability) in direct products, provided that, for every infinite semigroup T, the direct product S x T is finitely generated (resp., finitely presented) if and only if T is finitely ...
Ruskuc, Nikola, Araujo, IM
core +2 more sources
The Binding Number of a Zero Divisor Graph [PDF]
, 2013 In this paper, we evaluate b(Γ(Z n )). Our main result is, we give maximum value of b(Γ(Z n )) is 0.99999999796427626489236243072661, where n is any positive integer upto fiftieth million.
J Ravi Sankar +3 more
core
Journal of Mathematics, Volume 2026, Issue 1, 2026.Let G be a connected graph. A subset S⊆V(G) is called a general position set of a graph G if no shortest path in G contains more than two vertices from S. Likewise, a subset X⊆E(G) is an edge general position set if no shortest path contains more than two edges from X.
Zahra Hamed-Labbafian +2 more
wiley +1 more source
Spectral Characterization of the Eccentricity Matrix for Clean Graphs Over Rings of Specific Orders
Journal of Mathematics, Volume 2026, Issue 1, 2026.In this paper, we study the eccentricity matrices of the clean graphs CLZp2 and CLZp⊕Zp. We begin by constructing these graphs and determining their eccentricity matrices. Then, we find the spectra of these matrices, that is, all eigenvalues together with their algebraic multiplicities.
Eman Rawshdeh +4 more
wiley +1 more source
Dominant Metric Dimension of Unit Graphs of Finite Commutative Rings
Journal of Mathematics, Volume 2026, Issue 1, 2026.Let R be a finite commutative ring with identity and let U(R) denote its unit group. The unit graph GU(R) is the simple graph on the vertex set R in which distinct vertices x, y are adjacent if and only if x + y ∈ U(R). A dominating resolving set is a vertex set that dominates the graph and resolves all vertices via distance representations; the ...
Eman S. Almotairi, Smritijit Sen
wiley +1 more source