نتایج جستجو برای: ower graph

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

Journal: :transactions on combinatorics 2014
mostafa tavakoli f. rahbarnia m. mirzavaziri a. r. ashrafi

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

Journal: :algebraic structures and their applications 0
hamid reza dorbidi university of jiroft

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

Journal: :journal of algorithms and computation 0
kristiana wijaya combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia lyra yulianti department of mathematics, faculty of mathematics and natural sciences, andalas university, kampus unand limau manis padang 25136 indonesia edy tri baskoro combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia hilda assiyatun combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia djoko suprijanto combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

Journal: :iranian journal of mathematical chemistry 2013
m. tavakoli f. rahbarnia

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

Journal: :Obstetrics and gynecology 2009
Iain Chalmers Paul Glasziou

“Research results should be easily accessible to people who need to make decisions about their own health... Why was I forced to make my decision knowing that information was somewhere but not available? Was the delay because the results were less exciting than expected? Or because in the evolving fi eld of myeloma research there are now new exciting hypotheses (or drugs) to look at? How far ca...

2016
Thiago Ferreira de Paiva Leite Rodrigo Possamai Bastos Laurent Fesquet

P ower consumption is becoming a critical concern in nowadays digital circuits’ design, especially for battery powered portable applications. In this context, asynchronous circuits represent one of the possible solutions for addressing power consumption issues, they can operate correctly at extremely low power supplies and are conceptually robust to PVT variation. This paper evaluates the power...

1997
Christer Berg

We propose a symmetric version of Razborov's method of approximation to prove lower bounds for monotone circuit complexity. Traditionally, only DNF formulas have been used as approximators, whereas we use both CNF and DNF formulas. As a consequence we no longer need the Sun-ower lemma that has been essential for the method of approximation. The new approximation argument corresponds to Haken's ...

2010
Suzana Alcantara G. Lohmann

782 American Journal of Botany 97(5): 782–796, 2010; http://www.amjbot.org/ © 2010 Botanical Society of America Understanding how reproductive traits evolved in the past leads to important insights into how organisms adapted. In sexually reproducing organisms, traits associated with outcrossing are thought to be under strong selection because of their direct effect on reproductive success; the ...

Journal: :Journal of the American College of Cardiology 2004
Arthur J Moss

t has been known for some time that an altered sequence of entricular activation with a left bundle-branch conduction isturbance or right ventricular pacing is associated with a eduction in systolic and diastolic function manifested by ower ejection fraction and higher filling pressures. Furtherore, a variety of studies have shown that for a period of ime following cessation of the conduction d...

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

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