نتایج جستجو برای: degree of vertex
تعداد نتایج: 21170588 فیلتر نتایج به سال:
if $g$ is a connected graph with vertex set $v$, then the eccentric connectivity index of $g$, $xi^c(g)$, is defined as $sum_{vin v(g)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. in this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
utopia has, for four centuries, accompanied that hope of progress and that striving for betterment. it now straggles against a widespread sense that this has been an illusion, or an impossible dream. the utopian idea can never entirely disappear, but utopia as a form of the social imagination has clearly weakened. if it cannot instill its vision in the public consciousness, the consequences...
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
a professional is someone whose work involves performing a certain function with some degree of expertise. but a narrower definition limits the term to apply to people such as teachers and doctors, whose expertise involves not only skill and knowledge but also the exercise of highly sophisticated judgment, and whose accreditation necessitates extensive study, often university-based as well as p...
this study purported to compare and contrast the use of self-mention and evidentials as two mtadiscourse features in opinion columns of persian and english newspapers. the theoretical basis of this study is the idea that metadiscourse features vary across cultural boundaries. for this purpose, 150 persian and 150 english opinion columns were collected based on three factors of topic, audience a...
abstract this thesis includes five chapter : the first chapter assign to establish fuzzy mathematics requirement and introduction of liner programming in thesis. the second chapter we introduce a multilevel linear programming problems. the third chapter we proposed interactive fuzzy programming which consists of two phases , the study termination conditions of algorithm we show a satisfac...
This paper studies degree-bounded vertex partitions, considers analogues for wellknown results on the chromatic number and graph perfection, and presents two algorithms for constructing degree-bounded vertex partitions. The first algorithm minimizes the number of partition classes. The second algorithm minimizes a weighted sum of the partition classes where the weight of a partition class depen...
plagiarism in esl/efl learning contexts has been established as a dynamic and multi-layered phenomenon and has become a topic engaging many researchers in a heated debate in recent years. comparisons of student-generated texts with their source texts have shown that students rely on source texts in their writings and copying is a major strategy used by both l1 and l2 writers. in our country a...
abstract this study aimed at investigating the translation of interjections from english into persian in dubbing. to carry out this study the expressive secondary interjections found in the film four weddings and a funeral and their equivalent in persian dubbed version were analyzed through the strategies proposed by cuenca. the descriptive analysis of the corpus showed that (strategy b) i.e...
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید