solvable graphs (also known as reachable graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). in this paper, the properties of solvable graphs are investigated, and a new concept in multi agent moti...

in this paper, we classify the indecomposable non-nilpotent solvable lie algebras with $n(r_n,m,r)$ nilradical,by using the derivation algebra and the automorphism group of $n(r_n,m,r)$.we also prove that these solvable lie algebras are complete and unique, up to isomorphism.

applications of hypergroups have mainly appeared in special subclasses. one of the important subclasses is the class of polygroups. in this paper, we study the notions of nilpotent and solvable polygroups by using the notion of heart of polygroups. in particular, we give a necessary and sufficient condition between nilpotent (solvable) polygroups and fundamental groups.

In this paper we introduce the concept of α-commutator which its definition is based on generalized conjugate classes. With this notion, α-nilpotent groups, α-solvable groups, nilpotency and solvability of groups related to the automorphism are defined. N(G) and S(G) are the set of all nilpotency classes and the set of all solvability classes for the group G with respect to different automorphi...

in this paper we introduce the concept of α-commutator which its definition is based on generalized conjugate classes. with this notion, α-nilpotent groups, α-solvable groups, nilpotency and solvability of groups related to the automorphism are defined. n(g) and s(g) are the set of all nilpotency classes and the set of all solvability classes for the group g with respect to different automorphi...

Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...

In this paper, we classify the indecomposable non-nilpotent solvable Lie algebras with $N(R_n,m,r)$ nilradical,by using the derivation algebra and the automorphism group of $N(R_n,m,r)$.We also prove that these solvable Lie algebras are complete and unique, up to isomorphism.

in this paper, we study the notion of solvable $l$-subgroup of an $l$-group and provide its level subset characterization and this justifies the suitability of this extension. throughout this work, we have used normality of an $l$-subgroup of an $l$-group in the sense of wu rather than liu.

Applications of hypergroups have mainly appeared in special subclasses. One of the important subclasses is the class of polygroups. In this paper, we study the notions of nilpotent and solvable polygroups by using the notion of heart of polygroups. In particular, we give a necessary and sufficient condition between nilpotent (solvable) polygroups and fundamental groups.