نتایج جستجو برای: degree of vertices
تعداد نتایج: 21168843 فیلتر نتایج به سال:
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 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...
For a graph Gand an integer k, denote by Vk the set {u E V(G) I d(u) 2 k}. Veldman proved that if G is a 2-connected graph of order n with n 5 3k 2 and IVkl 5 k, then G has a cycle containing all vertices of Vk. It is shown that the upper bound k on IVkl is close to best possible in general. For the special case k = A(G), it is conjectured that the condition lVkl I k can be omitted. Using a var...
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...
An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph asks to find a subset of the vertices of of cardinality such that the maximum weighted distances from to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.
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...
This work is devoted to the study of the typical structure of a random map. Maps are planar graphs embedded in the plane. We investigate the degree sequences of random maps from families of a certain type, which, among others, includes fundamental map classes like those of biconnected maps, 3-connected maps, and triangulations. In particular, we develop a general framework that allows us to der...
Given any graph $H$, a $G$ is said to be $q$-Ramsey for $H$ if every coloring of the edges with $q$ colors yields monochromatic subgraph isomorphic $H$. Such minimal additionally no proper $G'$ In 1976, Burr, Erdös, and Lovász initiated study parameter $s_q(H)$, defined as smallest minimum degree among all graphs this paper, we consider problem determining how many vertices $s_q(H)$ can contain...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید