نتایج جستجو برای: commuting graphs

تعداد نتایج: 103441  

Ali Zaeem-Bashi Modjtaba Ghorbani, Zahra Gharavi,

The non-commuting graph $Gamma(G)$ of a non-abelian group $G$ with the center $Z(G)$ is a graph with thevertex set $V(Gamma(G))=Gsetminus Z(G)$ and two distinct vertices $x$ and $y$ are adjacent in $Gamma(G)$if and only if $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.

For given non-abelian group G, the non-commuting (NC)-graph $Gamma(G)$ is a graph with the vertex set $G$ $Z(G)$ and two distinct vertices $x, yin V(Gamma)$ are adjacent whenever $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.

Journal: :Journal of Combinatorial Theory, Series A 2006

Journal: :Journal of Mathematics and Computer Science 2011

Journal: :Sociologija sela 1986
M Oliveira-roca

The author studies trends in commuting to the city of Zagreb in Croatia, Yugoslavia. Commuter surveys and bivariate analysis are used to describe the socioeconomic level, occupational status, transportation method, and place of residence of rural and urban residents who commute to the city. (SUMMARY IN ENG AND RUS)

Journal: :Journal of the Australian Mathematical Society 2016

Journal: :Ars Mathematica Contemporanea 2013

2008
A. Asghar Talebi

Let G be a abelian finite group. The non-commuting graph Δ(G) of G is defined as follows: The vertex set is G− Z(G), two vertex x and y are joined by an edge whenever xy = yx. Note that if G is abelian, then Δ(G) has no vertices. So, throughout this article let G be a nonabelian finite group. There are many papers on algebraic structure, using the properties of graphs, for instance see [4, 2, 3...

Journal: :Numerical Lin. Alg. with Applic. 2014
Panayot S. Vassilevski Ludmil Zikatanov

Motivated by the increasing importance of large-­‐scale networks typically modeled by graphs we study properties associated with the popular graph Laplacian. We exploit its mixed formulation based on its natural factorization as product of two operators. The goal is to construct a coarse version of the mixed form for the graph Laplacian operator with the purpose to construct a multilevel hierar...

2005
Sarah Perkins

Let G be a group and X a subset of G. The commuting graph on X, denoted C(G,X), has vertex set X and an edge joining x, y ∈ X whenever xy = yx. If in addition X is a set of involutions, then C(G,X) is called a commuting involution graph. Commuting graphs have been investigated by many authors. Sometimes they are tools used in the proof of a theorem, or they may be studied as a way of shedding l...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید