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

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

2015
Jennifer Lu Veronique Michaud Liliam Gabriela Guilarte Moya Fleur Gaudette Yat Hei Leung Jacques Turgeon

The organic anion transporting polypeptide 1A2 (OATP1A2), a membrane drug transporter expressed on important organs (such as the brain, kidney, and intestine) may be a key element in the disposition of drugs. Previous studies demonstrated that it could transport a broad spectrum of substrates, including endogenous molecules and clinically relevant drugs, such as several b-blockers and 3-hydroxy...

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: :Beilstein Journal of Organic Chemistry 2012

Journal: :Acta Crystallographica Section A Foundations of Crystallography 2011

Journal: :British Journal of Clinical Pharmacology 1974

Journal: :The Electronic Journal of Combinatorics 2009

Journal: :Cochrane Database of Systematic Reviews 2003

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

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