نتایج جستجو برای: enumerative in graph theory
تعداد نتایج: 17122970 فیلتر نتایج به سال:
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
in the new age, in regard to human success in education in the globalizing world, one can consider english proficiency and individual differences as two important issues. in efl settings, reading skill plays an important role in education. it seems that using multiple intelligences theory in efl classes which values individual differences by tapping different intelligences, can be rewarding. as...
abstract reception environment has considerable effects on accepting a translation. as the expectations of a target culture and its values and needs change throughout history, its criteria for accepting a translation or rejecting it will change accordingly (gentzler, 2001). the expectations of iran, as the reception environment in the present study, have changed after the islamic revolution. i...
We construct and analyze an explicit basis for the homology of the boolean complex of a finite simple graph. This provides a combinatorial description of the spheres in the wedge sum representing the homotopy type of the complex. We assign a set of derangements to any finite simple graph. For each derangement, we construct a corresponding element in the homology of the complex, and the collecti...
The problem of microword length minimization is crucial to the synthesis of microprogrammed controllers in digital systems. Unfortunately, this problem is NP-hard. Although various enumerative and heuristic methods have been developed, usually they cannot provide fast and e cient solutions to a large size problem. In this paper, we rst formulate the problem into a graph partitioning problem. An...
Listing all triangles in an undirected graph is a fundamental graph primitive with numerous applications. It is trivially solvable in time cubic in the number of vertices. It has seen a significant body of work contributing to both theoretical aspects (e.g., lower and upper bounds on running time, adaption to new computational models) as well as practical aspects (e.g. algorithms tuned for larg...
These expository notes are based on a series of lectures given at the May 2018 Snowbird workshop, Crossing Walls in Enumerative Geometry. We give an introductory treatment notion virtual fundamental class algebraic geometry, and describe new construction for Gromov-Witten theory hypersurface. The results presented here joint work with I. Ciocan-Fontanine, D. Favero, J. Guere, B. Kim.
among the low–dimensional allotropes of carbon, nanotubes and graphene have attracted very much attention from nano–science and nanotechnology specialists. they have been proposed as building blocks in nanometer device engineering. however, these structures are not defect–free. in this thesis, we focused on defective carbon nanotubes and graphene, and studied the effect of couple of very common...
this studyinvestigated therelations between examinees’ academic knowledge and theirperformanceonreading section of ielts and toefl (ibt) through using generalizabilitytheory. g-theory was utilized to investigate the effects of subtest, test items, participants and academic background on the reliability of ielts and toefl (ibt) score. tosamplethe subjectsofthissurvey,a placement testwasadministe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید