نتایج جستجو برای: subdivision of a graph

تعداد نتایج: 23284708  

2010
ERAN NEVO B. E. TENNER

We prove that the γ-vector of the barycentric subdivision of a simplicial sphere is the f -vector of a balanced simplicial complex. The combinatorial basis for this work is the study of certain refinements of Eulerian numbers used by Brenti and Welker to describe the h-vector of the barycentric subdivision of a boolean complex.

Journal: :transactions on combinatorics 2015
n. paramaguru r. sampathkumar

let $g$ be a connected graph of order $3$ or more and $c:e(g)rightarrowmathbb{z}_k$‎ ‎($kge 2$) a $k$-edge coloring of $g$ where adjacent edges may be colored the same‎. ‎the color sum $s(v)$ of a vertex $v$ of $g$ is the sum in $mathbb{z}_k$ of the colors of the edges incident with $v.$ the $k$-edge coloring $c$ is a modular $k$-edge coloring of $g$ if $s(u)ne s(v)$ in $mathbb{z}_k$ for all pa...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تحصیلات تکمیلی علوم پایه زنجان - دانشکده فیزیک 1392

in the first part of this thesis we explored wetting and its dynamics for small droplets. first, we showed how a simple feature of water droplets on a surface, i.e. laplace pressure, can be exploited to build a micropump. we investigated capillary pumping in microchannels both experimentally and numerically. putting two droplets of different sizes at the in/outlet of a microchannel, will ge...

Journal: :Computer Aided Geometric Design 2011
Hartmut Prautzsch Qi Chen

Midpoint subdivision generalizes the Lane-Riesenfeld algorithm for uniform tensor product splines and can also be applied to non regular meshes. For example, midpoint subdivision of degree 2 is a specific Doo-Sabin algorithm and midpoint subdivision of degree 3 is a specific Catmull-Clark algorithm. In 2001, Zorin and Schröder were able to prove C1-continuity for midpoint subdivision surfaces a...

Journal: :Australasian J. Combinatorics 2010
B. Sharada Nandappa D. Soner

A set D of vertices of a graph G is a dominating set if every vertex in V \D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set of G. The domination subdivision number of G is the minimum number of edges that must be subdivided (where each edge in G can be subdivided at most once) in order to increase the domination number. Arumugam h...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه رازی - دانشکده علوم 1391

in this work, a novel and fast method for direct analysis of volatile compounds (davc) of medicinal plants has been developed by holding a filament from different parts of a plant in the gc injection port. the extraction and analysis of volatile components of a small amount of plant were carried out in one-step without any sample preparation. after optimization of temperature, extraction time a...

Journal: :CoRR 2017
Ngoc-Khang Le

In this paper, we propose a polynomial-time algorithm to test whether a given graph contains a subdivision of K 4 as an induced subgraph.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم 1376

in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...

پایان نامه :دانشگاه آزاد اسلامی واحد کرمانشاه - دانشکده زبانهای خارجی 1393

this study investigated (a) the learners’ existing reading strategy repertoire, (b) the effect of instruction in reading strategies on learners’ strategic performance, and (c) the effect of explicit instruction in top-down reading strategies on reading comprehension ability of intermediate learners. the study was conducted with 40 intermediate efl learners in two groups of experimental and cont...

Journal: :Journal of Graph Theory 1997
Bojan Mohar

Gross and Rosen asked if the genus of a 2-dimensional complex K embeddable in some (orientable) surface is equal to the genus of the graph of appropriate barycentric subdivision of K. We answer the nonorientable genus and the Euler genus versions of Gross and Rosen's question in affirmative. We show that this is not the case for the orientable genus by proving that taking blog2 gcth barycentric...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید