نتایج جستجو برای: s order tree bipartition

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

Journal: :Discrete Mathematics 2023

A conjecture of Luo, Tian and Wu (2022) says that for every positive integer k finite tree T with bipartition X Y (denote t=max⁡{|X|,|Y|}), k-connected bipartite graph G δ(G)≥k+t contains a subtree T′≅T such κ(G−V(T′))≥k. In this paper, we confirm caterpillars when k=3 spiders k≤3.

Journal: :Computers & Mathematics with Applications 2010
Mohammad Asadzadeh A. Brahme J. Kempe

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t The present paper is focused on the mathematical modeling of the charged particle transport in nonuniform me...

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

this research was conducted in two protect and destroy region in the middle zagros, in illam province. in order to identification of ecological species group and evaluate density of regeneration, effect of many factors such as protection, vegetation, physiographic factors, physical and chemical properties of soil in study locations were studied. to achieve these purpose number of 54 plots using...

1987
M. D. ATKINSON

There are 2”-t ways in which a tree on n vertices can be oriented. Each of these can be regarded as the (Hasse) diagram of a partially ordered set. The maximal and minimal widths of these posets are determined. The maximal width depends on the bipartition of the tree as a bipartite graph and it can be determined in time O(n). The minimal width is one of LA/21 or IA/21 + 1, where 1 is the number...

2006
Guido W. Grimm Susanne S. Renner Alexandros Stamatakis Vera Hemleben

The multi-copy internal transcribed spacer (ITS) region of nuclear ribosomal DNA is widely used to infer phylogenetic relationships among closely related taxa. Here we use maximum likelihood (ML) and splits graph analyses to extract phylogenetic information from approximately 600 mostly cloned ITS sequences, representing 81 species and subspecies of Acer, and both species of its sister Dipteron...

Journal: :IEEE Trans. VLSI Syst. 2002
Shanq-Jang Ruan Edwin Naroska Yen-Jen Chang Feipei Lai Uwe Schwiegelshohn

This brief proposes a new algorithm to synthesize low power bipartition-codec architecture for pipelined circuits. The bipartition-codec architecture has been introduced as an effective power reduction technique for circuit design. The entropy-based partition-codec (ENPCO) algorithm extends this approach as it optimizes for both: power and area. It uses entropy as a criterion to balance between...

Journal: :جنگل و فرآورده های چوب 0
پدرام غدیری پور کارشناس ارشد پژوهش، مؤسسۀ تحقیقات جنگل ها و مراتع کشور، تهران، ایران خسرو ثاقب طالبی دانشیار پژوهش، مؤسسۀ تحقیقات جنگل ها و مراتع کشور، تهران، ایران محمد حسن صالحه شوشتری کارشناس پژوهش، مرکز تحقیقات کشاورزی و منابع طبیعی خوزستان، اهواز، ایران امید اسماعیل زاده استادیار، دانشگاه تربیت مدرس، دانشکدۀ منابع طبیعی و علوم دریایی، نور، ایران

in order to investigate some silvicultural and soil physico-chemical characteristics of christ's thorn (ziziphus spina christi l. desf.) natural stands, ten natural stands of the tree species which have similar climate and aspects were selected and altitude from sea level (asl), the thickest sprout collar diameter (tscd) and total tree height (th) of the tree species were measured in 1000 ...

1998
J. Cong A. B. Kahng S. Dhar M. A. Franklin M. A. B. Jackson A. Srinivasan

In the design of high performance VLSI systems, minimization of clock skew is an increasingly important objective. Additionally, wirelength of clock routing trees should be minimized in order to reduce system power requirements and deformation of the clock pulse at the synchronizing elements of the system. In this paper, we rst present the Deferred-Merge Embedding (DME) algorithm, which embeds ...

Journal: :Discrete Mathematics 1988
Hian Poh Yap

Suppose Gi, G2, . . . , Gk are graphs of order at most n. We say that there is a packing of Gi, G2, . . . , G, into the complete graph K,, if there exist injections q : V(G,)+ V(K,), i = 1, 2, . . . , k such that aT(E(Gi)) fl (Y/*(E(G~)) = $ for i #j, where the map ar: : E(G,)-+ E(K,) . IS induced by a;. Similarly, suppose G is a graph of order m and H is a graph of order n 2 m and there exists...

Journal: :Discrete Optimization 2016

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

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