نتایج جستجو برای: degree of vertices
تعداد نتایج: 21168843 فیلتر نتایج به سال:
The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
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.
the following null hypothesis was proposed: h : there is no significant difference between the use of semantically or communicatively translates scientific texts. to test the null hypothesis, a number of procedures were taken first, two passages were selected form soyrcebooks of food and nutrition industry and gardening deciplines. each, in turn, was following by a number of comprehension quest...
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 eigenva...
the application of e-learning systems - as one of the solutions to the issue of anywhere and anytime learning – is increasingly spreading in the area of education. content management - one of the most important parts of any e-learning system- is in the concern of tutors and teachers through which they can obtain means and paths to achieve the goals of the course and learning objectives. e-learn...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید