نتایج جستجو برای: ladder and complete graph

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

Journal: :Behavioural brain research 2007
Brian J Cummings Christie Engesser-Cesar Gilbert Cadena Aileen J Anderson

Locomotor impairments after spinal cord injury (SCI) are often assessed using open-field rating scales. These tasks have the advantage of spanning the range from complete paralysis to normal walking; however, they lack sensitivity at specific levels of recovery. Additionally, most supplemental assessments were developed in rats, not mice. For example, the horizontal ladder beam has been used to...

Journal: :algebraic structures and their applications 2014
sh. payrovi h. pasebani

let $g$ be a group. the order graph of $g$ is the (undirected)graph $gamma(g)$,those whose vertices are non-trivial subgroups of $g$ and two distinctvertices $h$ and $k$ are adjacent if and only if either$o(h)|o(k)$ or $o(k)|o(h)$. in this paper, we investigate theinterplay between the group-theoretic properties of $g$ and thegraph-theoretic properties of $gamma(g)$. for a finite group$g$, we s...

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...

ژورنال: :مکانیک سازه ها و شاره ها 2013
علی اکبر پویان زینب مزینانیان رضا شمس

this paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and petri nets. in the beginning, programmable logic controllers were widely designed by ladder logic diagrams. when complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. thus, petri nets as a high l...

ژورنال: پژوهش های ریاضی 2022

Let R be a commutative ring with identity and Nil(R) be the set of nilpotent elements of R. The nil-graph of ideals of R is defined as the graph AG_N(R) whose vertex set is {I:(0)and there exists a non-trivial ideal  such that  and two distinct vertices  and  are adjacent if and only if . Here, we study conditions under which  is complete or bipartite. Also, the independence number of  is deter...

ژورنال: مجله دندانپزشکی 2007
صراف پور, بابک, صوابی, امید, میرابی, داریوش, نجاتی دانش, فرحناز,

Background and Aim: Designing removable partial dentures is one of the most important phases of prosthetic treatments. Computer can be used to facilitate and increase accuracy of removable partial denture design. The aim of this study was to develop a software for removable partial denture design.Materials and Methods: A questionnaire (discussed in part I) and major textbooks, were used to dete...

Journal: :international journal of group theory 0
alfredo donno università di roma "la sapienza"

‎we investigate two constructions‎ - ‎the replacement and the zig-zag‎ ‎product of graphs‎ - ‎describing several fascinating connections‎ ‎with combinatorics‎, ‎via the notion of expander graph‎, ‎group‎ ‎theory‎, ‎via the notion of semidirect product and cayley graph‎, ‎and‎ ‎with markov chains‎, ‎via the lamplighter random walk‎. ‎many examples‎ ‎are provided‎.

Journal: :Australasian J. Combinatorics 2006
Pingge Chen Yaoping Hou Ching-Wah Woo

In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be   $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...

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

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