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

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

Journal: :Bulletin of the National Research Centre 2022

Abstract Background The aim of the study is to assess bonding two repair methods for zirconia. Null hypothesis Repair zirconia with Cojet (3M sand, 68,411) and clearfil (clearfil REPAIR Kuraray Japan) has same effect on bond strength restorations. Zirconia blocks were sliced before sintering into 28 samples (inCorisZI mono L), surface treated (Cojet clearfil) then bonded composite. Storage ther...

2013
Lu Bai Edwin R. Hancock Lin Han

Riesen and Bunke recently proposed a novel dissimilarity based approach for embedding graphs into a vector space. One drawback of their approach is the computational cost graph edit operations required to compute the dissimilarity for graphs. In this paper we explore whether the Jensen-Shannon divergence can be used as a means of computing a fast similarity measure between a pair of graphs. We ...

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

0

The aim of this work was to develop a new and simple coacervative extraction method for the preconcentration and spectrophotometric determination of Cu(II) in water samples. Dithizone was used as the chelating agent while an anionic surfactant, namely sodium dodecyl sulfate (SDS), was used as extracting agent at room temperature. Central composite design (CCD) based on response surface methodol...

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.

Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...

Journal: :International Journal of Advanced Computer Science and Applications 2019

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

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