نتایج جستجو برای: radial graph
تعداد نتایج: 258132 فیلتر نتایج به سال:
a novel ultra wideband microstrip bandpass filter using radial stub loaded resonator and interdigital coupled lines is presented in this paper. the radial stub loaded resonator and decagonal patch form a resonator named m to create tuneable multiple notches in the passband for suppression wlan interference. to realize sharp roll-off, two adjustable transmission nulls are located at the lower an...
نیاز روز افزون صنعت به استفاده از قطعاتی با هندسه ی پیچیده مانند سطوح قالب ها و پره های توربین، منجر به پیشرفت هایی در زمینه ی تکنولوژی های جدید طراحی و ساخت این نوع قطعات گردیده است. محققین از روش های مختلفی برای ساخت سریع و با راندمان بالای این سطوح استفاده کردند. از جمله ی این روش ها استفاده از استراتژی های مناسب مسیر ابزار است. استراتژی های فرزکاری علاوه بر زمان تولیدی بر روی نیروهای ماشینک...
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...
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.
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 ...
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.
In eye tracking research, finding eye movement patterns and similar strategies between participants’ eye movements is important to understand task solving strategies and obstacles. In this application paper, we present a graph comparison method using radial graphs that show Areas of Interest (AOIs) and their transitions. An analyst investigates a single graph based on dwell times, directed tran...
A constrained contour is an outline of a region of interest, obtained by linking edges under the constraints of connectivity, smoothness, image context and subjective or user speciied constraints. We discuss a constrained contouring algorithm in polar coordinates to trace closed contours. The algorithm nds optimal contour locations in all radial direction according to the constraints of context...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید