نتایج جستجو برای: squared graph

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

2003
JAN DE LEEUW

In the usual forms of homogeneity analysis (which are also known as multiple correspondence analysis or MCA) the size of a point set is defined as the size of the star plot of the set. The star plot is the graph defined by connecting all points in the set with their centroid, and the size is the total squared length of the edges. In order to prevent trivial solutions the configuration X is usua...

2002
Ramón Alberto Mollineda Enrique Vidal Francisco Casacuberta

A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, which are founded on a window-constrained edit graph related to the strings involved. Weights are the ones which minimize the sum of squared relative errors of the weighted solution with respect to exact values, on a tra...

Journal: :bulletin of the iranian mathematical society 0
r. kafshgarzaferani

0

Journal: :journal of linear and topological algebra (jlta) 2015
m ahrari sh. a. safari sabet b amini

the annihilating-ideal graph of a commutative ring $r$ is denoted by $ag(r)$, whose vertices are all nonzero ideals of $r$ with nonzero annihilators and two distinct vertices $i$ and $j$ are adjacent if and only if $ij=0$. in this article, we completely characterize rings $r$ when $gr(ag(r))neq 3$.

Journal: :iranian journal of mathematical chemistry 0
b basavanagoud karnatak university dharwad s. patil karnatak university v r desai karnatak university m tavakoli ferdowsi university of mashhad a r ashrafi university of kashan

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.

Journal: :iranian journal of mathematical chemistry 2012
m. ghorbani a. zaeembashi m. shahrezaei a. tabatabaei adnani

it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...

Journal: :algebraic structures and their applications 2015
hossein rashmanlou r.a. borzooei

in this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. also, density and balanced irregular vague graphs are discussed and some of their properties are established. finally we give an application of vague digraphs.

Journal: :Molecular Biology and Evolution 2006

Journal: :The Annals of Statistics 2004

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

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