‎A set of vertices $S$ of a graph $G$ is called a fixing set of $G$‎, ‎if only the trivial automorphism of $G$ fixes every vertex in $S$‎. ‎The fixing number of a graph is the smallest cardinality of a fixing‎ ‎set‎. ‎The fixed number of a graph $G$ is the minimum $k$‎, ‎such that ‎every $k$-set of vertices of $G$ is a fixing set of $G$‎. ‎A graph $G$‎ ‎is called a $k$-fixed graph‎, ‎if its fix...

This study set out to investigate the effect of bio-fertilizers containing nitrogen-fixing bacteria and phosphorus on grain yield and yield components of Faba bean. To this end a factorial experiment on the basis of randomized complete block design with four replications was conducted in Behbahan region at South eastern part of Khuzestan Province of Iran. The experimental treatments included Ni...

The fixing number of a graph G is the minimum cardinality of a set S ⊂ V (G) such that every nonidentity automorphism of G moves at least one member of S, i.e., the automorphism group of the graph obtained from G by fixing every node in S is trivial. We provide a formula for the fixing number of a disconnected graph in terms of the fixing numbers of its components and make some observations abo...

this study set out to investigate the effect of bio-fertilizers containing nitrogen-fixing bacteria and phosphorus on grain yield and yield components of faba bean. to this end a factorial experiment on the basis of randomized complete block design with four replications was conducted in behbahan region at south eastern part of khuzestan province of iran. the experimental treatments included ni...

The fixing number of a graph G is the smallest cardinality of a set of vertices S such that only the trivial automorphism of G fixes every vertex in S. The fixing set of a group Γ is the set of all fixing numbers of finite graphs with automorphism group Γ. Several authors have studied the distinguishing number of a graph, the smallest number of labels needed to label G so that the automorphism ...

A knockout (or single-elimination) tournament is a format of competition that very popular in practice (particularly sports, elections and decision making), which has been extensively intensively studied from theoretical point view for more than decade. Particular attention devoted to the Tournament Fixing problem, where, roughly speaking, objective determine whether we can conduct way makes ou...

in order to study the effect of vermicompost and nitrogen fixing bacteria on seed yield, yield components of seed and essential oil content of coriander (coriandrum sativum), an experiment was conducted as factorial experiment in the base of randomized complete blocks design with eight treatments and three replications at research field of agriculture company of ran in firouzkuh of iran in 2012...

We present PCR, a new automatic patch generation system. PCR uses a new condition synthesis technique to efficiently discover logical expressions that generate desired controlflow transfer patterns. Presented with a set of test cases, PCR deploys condition synthesis to find and repair incorrect if conditions that cause the application to produce the wrong result for one or more of the test case...

In this paper we study the algorithmic complexity of following problems: (1) Given a vertex-colored graph X = (V,E,c) , compute minimum cardinality set vertices S⊆ V such that no nontrivial automorphism fixes all in S . A closely related problem is computing base for permutation group G ≤ Sym( n ) given by generators, i.e., subset ⊆ [ ] elements Our focus mainly on parameterized these problems....