نتایج جستجو برای: types of graphs
تعداد نتایج: 21183499 فیلتر نتایج به سال:
esl/efl books play a crucial role in shaping language learners worldview of gender roles in society. the present study investigated the status of sexism in two sets of efl textbooks, one developed by non-native iranian authors (ili series) and the other by native authors (top notch series). first, two books from each series was selected randomly. then, a quantitative analysis was carried out wi...
nowadays, the development of anti cancer drugs is an important subject in pharmacology. bisphosphonates (b.p) are a great choice for design and production of the types of drugs which not only could perform as anti cancer agents but also could inhibit the function of acetyl cholinesterase (ache). ache hydrolyzes the acetylcholine (which is a neurotransmitter in nervous system) using the oh in i...
let $g$ be a graph without an isolated vertex, the normalized laplacian matrix $tilde{mathcal{l}}(g)$is defined as $tilde{mathcal{l}}(g)=mathcal{d}^{-frac{1}{2}}mathcal{l}(g) mathcal{d}^{-frac{1}{2}}$, where $mathcal{d}$ is a diagonal matrix whose entries are degree of vertices of $g$. the eigenvalues of$tilde{mathcal{l}}(g)$ are called as the normalized laplacian ...
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [−1− √ 2,−2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [α1,−1− √ 2) where α1 is the smallest root(≈ −2.4812) of the polynomial x3 + 2x2 − 2x − 2. From these results, we ...
iv Acknowledgements v List of Tables vii List of Graphs vii
the energy of a graph is equal to the sum of the absolute values of its eigenvalues. two graphs of the same order are said to be equienergetic if their energies are equal. we point out the following two open problems for equienergetic graphs. (1) although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pa...
abstract nowadaysphotovoltaic solar cells (pvs) areacknowledged the fastest growing energy technology in the word, however, they only account for only fraction of current global renewable energy capacity. it isrecognized that this incomplete market penetration has been largely a result of the technology’sexcessive cost. so researchers are trying to find innovative, economic way with theaim of ...
building on previous studies on the effectiveness of different types of written corrective feedback, the present study aimed at investigating whether direct focused corrective feedback and direct unfocused corrective feedback produced any differential effects on the accurate use of english articles by efl learners across two different proficiency levels (low and high). in current study, the par...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید