نتایج جستجو برای: graph methods
تعداد نتایج: 2044873 فیلتر نتایج به سال:
a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...
0
in this paper we study the coprime graph of a group $g$. the coprime graph of a group $g$, is a graph whose vertices are elements of $g$ and two distinct vertices $x$ and $y$ are adjacent iff $(|x|,|y|)=1$. in this paper we classify all the groups which the coprime graph is a complete r-partite graph or a planar graph. also we study the automorphism group of the coprime graph.
0
In exploratory factor analysis, although the researchers decide which items belong to factors by considering statistical results, decisions taken sometimes can be subjective in case of having with similar loadings and complex structures. The aim this study was examine validity classifying into dimensions graph analysis (EGA), has been used determining number recent years machine learning method...
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید