نتایج جستجو برای: spider graph
تعداد نتایج: 207352 فیلتر نتایج به سال:
more than 40,000 species of spiders have been identified in the world. spider bites is a common problem among people, however few of them are harmful but delay in treatment can cause death. since the spider bites are risk full to human, they should be taken seriously, especially in endemic areas. our objective in this review was to study about poisonous spiders and find out treatments of them. ...
Undirected graphs of pathwidth at most one are characterized by two forbidden minors i.e., (i) K3 the complete graph on three vertices and (ii) S2,2,2 the spider graph with three legs of length two each [BFKL87]. Directed pathwidth is a natural generalization of pathwidth to digraphs. In this paper, we prove that digraphs of directed pathwidth at most one are characterized by a finite number of...
the neogene intrusion masses in the noudeh-enghelab area located to the north of sabzevar ophiolite have cut the late cretaceous ophiolitic rocks, sedimentary- volcanic and eocene volcanic rocks and have been covered by pliocene and quaternary deposits. the margin is of lava with basalt, phyric andesite-basalt and andesite and the central parts (dome shaped) composed of phyric andesite-trachyan...
We study the maximum differential coloring problem, where the vertices of an n-vertex graph must be labeled with the numbers 1, ..., n such that the minimum difference between the two labels of any adjacent vertices is maximized. As it is NP-hard to find the optimal labels for general graphs, we consider special sub-classes: caterpillars, spiders, and extended stars. We first prove new upper bo...
Pattern is a package for Python 2.4+ with functionality for web mining (Google + Twitter + Wikipedia, web spider, HTML DOM parser), natural language processing (tagger/chunker, n-gram search, sentiment analysis, WordNet), machine learning (vector space model, k-means clustering, Naive Bayes + k-NN + SVM classifiers) and network analysis (graph centrality and visualization). It is well documente...
Let G be a graph with its vertices and edges. On defining bijective function ρ:V(G) →{0,1,...,p}. For each edge assign the label 1 if ρ*(ab)= | ρ(a) 2 −ρ(b) /ρ(a)−ρ(b) is odd or 0 otherwise such that |eρ(1) − eρ(0)| ≤ then labeling called as divided square difference cordial graph. We prove in this paper for relatively possible set of spider graphs atmost one legs greater than namely J(SP(1 m ,...
background: in order to describe the patients and evaluate the effectiveness of treatments for widow spider envenomation, investigators require a reliable assessment tool. in this paper, the development of a clinical index for measuring the widow spider bite severity, latrodectus envenomation severity score (less), is described. methods: according to the valid methods for index development, a d...
We generalize the notion of regular polyhedral subdivision of a point (or vector) configuration in a new direction. This is done after studying some related objects, like the finest regular coarsening and the regularity tree of a subdivision. Properties of these two objects are derived, which confer more structure to the class of non-regular subdivisions, relating them to its (in a sense) close...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید