Results 1 to 10 of about 1,461 (103)
Deriving Some Properties of Stanley-Reisner Rings from Their Squarefree Zero-Divisor Graphs
Let ∆ be a simplicial complex, I∆ its Stanley-Reisner ideal and R = K[∆] its Stanley-Reisner ring over a field K. In 2018, the author introduced the squarefree zero-divisor graph of R, denoted by Γsf(R), and proved that if ∆ and ∆′ are two simplicial ...
A. Nikseresht
semanticscholar +1 more source
A GENERALIZATION OF THE ESSENTIAL GRAPH FOR MODULES OVER COMMUTATIVE RINGS
Let R be a commutative ring with nonzero identity and let M be a unitary R-module. The essential graph of M , denoted by EG(M) is a simple undirected graph whose vertex set is Z(M)\AnnR(M) and two distinct vertices x and y are adjacent if and only if ...
F. Soheilnia, S. Payrovi, A. Behtoei
semanticscholar +1 more source
On the Non-Inverse Graph of a Group
Let (G, *) be a finite group and S = {u ∈ G|u ≠ u−1}, then the inverse graph is defined as a graph whose vertices coincide with G such that two distinct vertices u and v are adjacent if and only if either u * v ∈ S or v * u ∈ S.
Amreen Javeria, Naduvath Sudev
doaj +1 more source
Determining Number of Kneser Graphs: Exact Values and Improved Bounds [PDF]
The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial.
Angsuman Das, Hiranya Kishore Dey
doaj +1 more source
Remark on subgroup intersection graph of finite abelian groups
Let G be a finite group. The subgroup intersection graph Γ(G)\text{Γ}(G) of G is a graph whose vertices are non-identity elements of G and two distinct vertices x and y are adjacent if and only if |〈x〉∩〈y〉|>1|\langle x\rangle \cap \langle y\rangle
Zhao Jinxing, Deng Guixin
doaj +1 more source
Mobius Group Generated by Two Elements of Order 2, 4, and Reduced Quadratic Irrational Numbers
The construction of circuits for the evolution of orbits and reduced quadratic irrational numbers under the action of Mobius groups have many applications like in construction of substitution box (s‐box), strong‐substitution box (s.s‐box), image processing, data encryption, in interest for security experts, and other fields of sciences.
Dilshad Alghazzawi +5 more
wiley +1 more source
Curve graphs for Artin–Tits groups of type B, A∼ and C∼ are hyperbolic
Abstract The graph of irreducible parabolic subgroups is a combinatorial object associated to an Artin–Tits group A defined so as to coincide with the curve graph of the (n+1)‐times punctured disk when A is Artin's braid group on (n+1) strands. In this case, it is a hyperbolic graph, by the celebrated Masur–Minsky's theorem.
Matthieu Calvez +1 more
wiley +1 more source
Deforming cubulations of hyperbolic groups
Abstract We describe a procedure to deform cubulations of hyperbolic groups by ‘bending hyperplanes’. Our construction is inspired by related constructions like Thurston's Mickey Mouse example, walls in fibred hyperbolic 3‐manifolds and free‐by‐Z groups, and Hsu–Wise turns.
Elia Fioravanti, Mark Hagen
wiley +1 more source
Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups [PDF]
We prove by explicit construction that graph braid groups and most surface groups can be embedded in a natural way in right-angled Artin groups, and we point out some consequences of these embedding results.
J. Crisp, B. Wiest
semanticscholar +1 more source
Symmetric graphs of valency seven and their basic normal quotient graphs
We characterize seven valent symmetric graphs of order 2pqn2p{q}^{n} with ...
Pan Jiangmin, Huang Junjie, Wang Chao
doaj +1 more source

