نتایج جستجو برای: graph theory and matrix approach
تعداد نتایج: 17150322 فیلتر نتایج به سال:
the research questions were as follows: 1. is there any relationship between the students concious awareness of the form and implications of the conjuncations and their improvement in using appropriate conjunctions? 2. does students knowledge of the from and the implications of the conjunctions help them to produce more coherent writings. 3. does a comparison between english conjunctions and th...
previous studies have aimed at testing a hypothesis but the present study is data-first research in which researcher tries to form a theory from data rather than the use of data to test a hypothesis. this study aims at exploring teachers perceptions of the strengths and weaknesses of the current syllabus for college preparatory course. eight experienced teachers were selected to collect data du...
in this thesis, a new optically active poly(amide-imide) (pai) was synthesized by the indirect polycondensation reaction of the l-phenylalanine based diacid chloride and 4,4?-diaminodiphenylether in the presence of triethylamine in n-methyl-2-pyrrolidone. the formation of pai was confirmed by ftir, 1h nmr and elemental analysis. in next step, the surface of titanium dioxide (tio2) nanoparticles...
postcolonial feminism, also dubbed as third world feminism, is an innovative approach, demonstrating the way women of colonized countries suffer from both native patriarchies and imperial ideology. also due to this double-colonization, postcolonial feminists contend that third world women are subjected to both colonial domination of empire and male domination of patriarchy. while western femini...
let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and edge set $e(g) = {e_1, e_2,ldots , e_m}$. similar tothe randi'c matrix, here we introduce the randi'c incidence matrixof a graph $g$, denoted by $i_r(g)$, which is defined as the$ntimes m$ matrix whose $(i, j)$-entry is $(d_i)^{-frac{1}{2}}$ if$v_i$ is incident to $e_j$ and $0$ otherwise. naturally, therandi'c incidenc...
In 2003 Vladimir Nikiforov [7] began a line of research whose aim was to build an extremal theory of graphs based on spectral theory. We will discuss some of his results and in particular we will focus on a result of Babai and Guiduli [1] that gives a Kövari-Sós-Turán type upper bound on the largest eigenvalue of the adjacency matrix of a Ks,t-free graph. This spectral approach sheds new light ...
abstract: in the paper of black and scholes (1973) a closed form solution for the price of a european option is derived . as extension to the black and scholes model with constant volatility, option pricing model with time varying volatility have been suggested within the frame work of generalized autoregressive conditional heteroskedasticity (garch) . these processes can explain a number of em...
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید