English
Related papers

Related papers: On generalized non-commuting graph of a finite rin…

200 papers

Let $C(X)$ be the ring of all continuous real valued functions defined on a completely regular Hausdorff topological space $X$. The zero-set intersection graph $\Gamma (C(X))$ of $C(X)$ is a simple graph with vertex set all non units of…

Combinatorics · Mathematics 2024-05-06 Yangersenba T Jamir , S Dutta

We study graphs coming from quadratic spaces over finite fields via orthogonality which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2019). More precisely, we study the graph $\Gamma^{\square}(n,k,q)$ as follows: the…

Combinatorics · Mathematics 2020-04-24 Semin Yoo

Let $G$ be a non-abelian group. The non-commuting graph $\mathcal{A}_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joint if and only if they do not commute. In a finite simple…

Group Theory · Mathematics 2009-03-05 A. Abdollahi , A. Azad , A. Mohammadi Hassanabadi , M. Zarrin

Let $L$ be a finite-dimensional non-abelian Lie algebra with the center $Z(L)$. In this paper, we define a non-commuting graph associated with $L$ as the graph whose vertex set is the projective space of the quotient algebra $L/Z(L)$, and…

Rings and Algebras · Mathematics 2025-05-05 Songpon Sriwongsa

The canonical double cover $\D(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\Aut(\D(\Gamma))\cong\Aut(\Gamma)\times\ZZ_2$ then $\Gamma$ is called stable; otherwise $\Gamma$ is called unstable. An unstable…

Combinatorics · Mathematics 2020-10-29 Yan-Li Qin , Binzhou Xia , Sanming Zhou

Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$, denoted by $\Gamma'(R)$, is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$, and two distinct vertices $x$ and $y$ are…

Combinatorics · Mathematics 2022-05-25 Praveen Mathil , Barkha Baloda Jitender Kumar

Let $G=(V(G),E(G))$ be a simple connected and undirected graph with vertex set $V(G)$ and edge set $E(G)$. A set $S \subseteq V(G)$ is a $dominating$ $set$ if for each $v \in V(G)$ either $v \in S$ or $v$ is adjacent to some $w \in S$. That…

Combinatorics · Mathematics 2015-03-19 Haoli Wang , Xirong Xu , Yuansheng Yang , Guoqing Wang

In this paper, we introduce the graph $G(S)$ of a bounded semilattice $S$, which is a generalization of the intersection graph of the substructures of an algebraic structure. We prove some general theorems about these graphs; as an example,…

Combinatorics · Mathematics 2020-03-10 Parastoo Malakooti Rad , Peyman Nasehpour

A subset $S$ of a vertex set of a graph $G$ is a total $(k,r)$-dominating set if every vertex $u \in V(G)$ is within distance $k$ of at least $r$ vertices in $S$. The minimum cardinality among all total $(k,r)$-dominating sets of $G$ is…

Discrete Mathematics · Computer Science 2015-11-24 Louisa Harutyunyan

We formulate a notion of the quantum automorphism group of a $2$-graph. After some preliminary computations, we define quantum isomorphism between a pair of $2$-graphs. We produce a `non-trivial' example of a pair of $2$-graphs that are not…

Operator Algebras · Mathematics 2025-04-01 Soumalya Joardar , Atibur Rahaman , Jitender Sharma

For a commutative ring $A$ we consider a related graph, $\Gamma(A)$, whose vertices are the unimodular rows of length $2$ up to multiplication by units. We prove that $\Gamma(A)$ is path-connected if and only if $A$ is a…

K-Theory and Homology · Mathematics 2022-02-17 Kevin Hutchinson

Let $Z(G)$ be the centre of a finite non-abelian group $G.$ The non-commuting graph of $G$ is a simple undirected graph with vertex set $G\setminus Z(G),$ and two vertices $u$ and $v$ are adjacent if and only if $uv\ne vu.$ In this paper,…

Combinatorics · Mathematics 2022-08-02 Jharna Kalita , Somnath Paul

Let $G$ be a group and $S\subseteq G$ its subset such that $S=S^{-1}$, where $S^{-1}=\{s^{-1}\mid s\in S\}$. Then {\it the Cayley graph ${\rm Cay}(G,S)$} is an undirected graph $\Gamma$ with the vertex set $V(\Gamma)=G$ and the edge set…

Group Theory · Mathematics 2020-08-26 Wenbin Guo , Daria V. Lytkina , Victor D. Mazurov , Danila O. Revin

The zero-divisor graph $\Gamma(R)$ of an associative ring $R$ is the graph whose vertices are all nonzero zero-divisors (one-sided and two-sided) of $R$, and two distinct vertices $x$ and $y$ are joined by an edge iff either $xy=0$ or…

Rings and Algebras · Mathematics 2012-01-18 Yu. N. Maltsev , A. S. Kuzmina

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

Group Theory · Mathematics 2019-08-06 Andrea Lucchini

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

Combinatorics · Mathematics 2024-03-05 Teng Fang , Sanming Zhou , Shenglin Zhou

Let $R$ be a ring with unity. The \emph{idempotent graph} $G_{\text{Id}}(R)$ of a ring $R$ is an undirected simple graph whose vertices are the set of all the elements of ring $R$ and two vertices $x$ and $y$ are adjacent if and only if…

Combinatorics · Mathematics 2023-06-16 Praveen Mathil , Barkha Baloda , Jitender Kumar

Let $R$ be a commutative ring with $1\not = 0$, $Z(R)$ be the set of all zero-divisors of $R$, and $n \geq 1$. This paper introduces the $n$-total graph of a commutative ring $R$. The $n$-total graph of a commutative ring $R$, denoted by…

Commutative Algebra · Mathematics 2025-08-18 Djamila AitElhadi , Ayman Badawi

In this paper we give a new generalization of token graphs. Given two integers $1\leq m \leq k$ and a graph $G$ we define the generalized token graph of the graph $G$, to be the graph $F_k^m(G)$ whose vertices correspond to configurations…

Combinatorics · Mathematics 2025-09-03 C. Amairani Herrera-Ramirez , Teresa I. Hoekstra-Mendoza

A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number ${\rm…

Combinatorics · Mathematics 2019-04-17 Bijo S. Anand , Ullas Chandran S. V. , Manoj Changat , Sandi Klavžar , Elias John Thomas
‹ Prev 1 4 5 6 7 8 10 Next ›