Let be a finite solvable group and be the subset of , where is the set of all pairs of size two commuting elements in . If operates on a transitive – space by the action ; and , then orbits of are called orbitals. The subset represents diagonal orbital.
The orbital regular graph is a graph on which acts regularly on the vertices and the edge set. In this paper, we obtain the orbital regular graphs for some finite solvable groups using a regular action. Furthermore, the number of edges for each of a group’s orbitals is obtained.
Keywords: Solvable group, Orbital, Orbital graph, Orbital regular graph, Regular action
1. Introduction
Let be a group that acts on a
finite set . Then the orbit
of is the subset [1]. Later
on, Omer et al. [2] define
orbit as the set of all conjugates of the elements, where acts on itself by conjugation.
Furthermore, by defining an orbit graph as a graph whose vertices are
non-central orbits under group action on , Omer et al. [2] extended the work on conjugate
graphs. Using various group actions, they constructed orbit graphs for
various groups, such as finite non-abelian groups, finite p-groups, and
groups of order . They also used
a regular action to introduce the orbit graph for some finite solvable
groups.
If is transitive on then Fang et al. [3] define orbitals of as the orbits of transitive action on and the subset
form a diagonal orbital of .
Looking forward to the work, Smith [4] then constructed a new graph on , which he called an orbital
graph having vertex set
and an arc set of orbitals. He introduced the concepts of sub orbits and
orbitals using transitive action on a set. He constructed an orbital
graph from orbitals, which shows that the orbital graphs for each
orbital are different [4].
In the recent past, several research articles based on orbital graphs
have been studied related to groups. The primitive group with small
suborbital of length 3 or 4 and their orbital graph were introduced by
Li et al. [5]. They also
constructed vertex primitive half arc-transitive graphs of valency for an infinite number of integers k,
with fourteen being the smallest valency. Smith [4] looked into the diameter of an orbital graph that
was linked to a group.
Sheikh [6] proposed that
the orbital diameter must be bounded by a constant and that the actions must be bounded by
5. He also determined the infinite families of orbital graphs with a
diameter of 2. The action of SL(2, C) on hyperbolic 3-space and orbital
graphs was first observed by Besenk [7]. Recently, Nagnibeda et al. [8] published an article where they
show interest in orbital graphs for the action of spinal groups on d-
regular rooted trees and on their boundaries. Pogorelov just published a
classification for distance transitive orbital graphs over groups of the
Jevons group [9]. Rakvenyi
[10] introduced the concept of
the orbital diameter of groups of diagonal type.
Also, orbitals have a wide role in the field of sciences like
physics, chemistry, biology and many more. Hoffmann [11] investigates the orbitals’
interaction through space and bonds. King [12] found that to form hybrid orbitals of special
symmetries, the combination of atomic orbitals can be related to the
individual orbital polynomials. Using this approach, he found the system
of atomic orbital hybridization of coordination polyhedra and the role
of orbitals. Next, Rahaman and
Gagliardi [13] introduced a
deep learning-based framework that combines large organic molecules’
total energies and orbital energies using molecular fingerprints’
hybridisation.
Using the concept of orbitals, Sole [14] constructed an orbital regular graph as a graph,
if it is regular for some and derived an
edge-forwarding index formula for it. According to Fang et al., [3] almost all orbital regular
graphs are Frobenius graphs. However, many groups, such as finite
solvable groups for which the orbital regular graph is yet to be
constructed, are regular in their orbits.
In this article, we use regular action on a finite set . With this, we may now define
orbitals of as the orbits of the
regular action of on . Note that must be a subset of . In this work, we
use the concept of [14] and
[2], to determine the number
of edges for each orbital of a group as well as the orbital regular graphs
of a finite solvable group whose vertices are adjacent if there are
and such
that .
The graphs examined in this study are undirected.
2. Preliminaries
The orbit graph, orbital regular graph, group actions, and solvable
groups are all discussed in this section, along with some basic
concepts, definitions, and current results.
Suppose is a
non-trivial, simple, and finite graph with E as the edge set and V as
the vertex set. Let be a group
that acts on a finite set of on a regular basis. Then takes action on element-wise. When there is no
room for ambiguity, we write instead of and examine a subset of the manuscript.
Definition 1. A group is said to be solvable if it has a
normal series such that each normal factor is abelian.
Theorem 1. [2] The symmetric group is a solvable group if .
Definition 2 (Orbit). [15] Let
be a group that acts on a set and . The orbit of , denoted by is the subset . In this study, the group action is considered as a
conjugation action. Hence, the orbit is given as
Definition 3 (Orbit Graph). [2] Let ba a group and be a set. Then an orbit graph,
is defined as
a graph whose vertices are non central orbits under group action on the
set that is ,
where is a disjoint union
of distinct orbits and . Two vertices are adjacent
if are
conjugate that is .
Definition 4 (Orbital). [3] Let be transitive on then the orbits
of on are called as
orbitals of , denoted by .
Definition 5 (Orbital Graph). [4] Let be a group acting on and be its orbital. Then the orbital
graph with respect to is
the graph having as a
vertex set and as its arc
set.
Next, we define the finite set on which acts and its group actions.
Definition 6. [15] Let
be a group and be a set. acts on if there is a function which maps such that it
satisfies the following axioms:
Identity: , .
Compatibility: , .
Definition 7. [2] The set is the set of all pairs of
commuting elements of which are
in the form of
where , are the elements of the finite
solvable groups and the least common multiple of the order of the
elements is two. Symbolically, it is represented as
Definition 8. [4] The action of on a non empty set is transitive if for each pair
in there exist a in such that .
We recall [3] that the
group acts regularly on if it is both transitive and
. In this paper, we
defined regular action as follows:
Definition 9. A group acts regularly on a set if for any pair
there exist exactly one
such that .
On the basis of group actions, we defined orbital regular graph of a
group .
Definition 10. Let be a group which act regularly on the
set . Then the orbital
regular graph is the undirected graph if is regular on each of its orbits in
and one of these orbits is
exactly .
The following corollary shows that a finite solvable group acts
regularly on a finite set .
Corollary 1. [2] Let
be a finite solvable groups on a set . If acts regularly on . Then
In Corollary 1, Omer et al. [2] found the orbit graph for some finite solvable
groups and general formula for number of vertices and edges.
In this section, we present some results on the calculation of
orbitals concerning finite solvable groups. We use regular action to
find the orbital regular graph of a finite solvable group based on the
orbitals of the group. We also get the number of edges for each of a
group’s orbitals.
Theorem 2. Let be a finite
solvable group, where is
even. Then each orbital of has a
disconnected orbital regular graph with connected components, except one
orbital , .
Proof. Consider a finite solvable group , where is even. Let be the subset of and acts on by the action , where
and . This
implies, the number of elements in is . Based on
regular action, we found three different types of orbitals.
Case I
For orbital of the form , and . We consider two
subcases.
For , the
vertices in the form of
and ,
are
adjacent to the vertices in the form of and ,
. Thus, we
have , components of
.
On the other hand, the vertices in the form of , , and are adjacent to
one another to form
connected component of four vertices.
Thus, it follows that .
For , we found
that the
consist , components of
.
This implies, .
Case II
For orbital of the type ,
and there exist
such that
is adjacent to to
form one component, and one
complete component, . Hence it
follows that .
Case III
(Shows exception) Based on regular action the orbital of the
type ,
of size
two, there is always one common vertex of the form adjacent to the two
vertices of the type and
. Hence,
there are connected
orbital regular graph of three vertices.
Example 1. Consider a finite solvable group
of elements
and the elements of order two in
are .
This implies contains
elements.
If we take the orbital , . By applying regular
action on the orbital, we see that only the element acts on it.
That is, and contains
two components and one
complete component .
This implies that the orbital regular graph for the orbital is
disconnected, . The orbital regular graph for is presented in
Figure 1
Figure 1. Orbital Regular Graph for
Now, if we take a different orbital of the form , of size two. we produce
four such orbitals which have connected orbital regular graph of three
vertices. The orbital regular graph is presented in
Figure 2.
Figure 2. Orbital Regular Graph
Again, if we take orbital , we have two orbitals of
size two and one orbital of size four.
This implies that there is one component of the type and one
component is connected graph of four vertices.
Thus, . The orbital regular graph is presented in Figure
1.
Figure 3. Orbital Regular Graph
Here, we can find the graph for the other remaining orbitals and
see that each orbital have disconnected graph except one
orbital.
Theorem 3. Let be a finite
solvable group with even. Then
for each even and the orbital
have ,
have
connected orbital regular graph of three vertices,
have ,
,
have ,
have
disconnected orbital regular graph,
have
disconnected orbital regular graph.
Proof. Consider a finite solvable group , is even. Let be the subset of and acts regularly on . If is an orbital graph then each
orbital have distinct orbital graph and two vertices of a graph are
linked to each other if
there exist such that . To show
orbital regular graph of different orbitals and for even, we have four cases:
Case I
In the orbital , where . If acts regularly on then the vertices of the form
and are adjacent to the vertices
of the form and . Thus, we found that the
orbital consist of
, connected orbital regular graph
of four vertices.
This implies, .
On the other hand, for orbital ,
, the vertex
is
adjacent to the vertices and , . Hence, we have
connected orbital regular
graph of three vertices.
Case II
Consider the orbital of the form
and ,
,
If acts regularly on , we found that both the orbitals
are central orbitals and each having two adjacent vertices of the type
, and , . Hence, for
both the orbitals we have .
Case III
For orbital of the form where , the orbital regular
graph of a particular orbitals are;
Hence, we found that each orbital have and also there exist one orbital which always have .
Thus, we can say that the orbital have
disconnected orbital regular graph.
Case IV
For Orbital where
, we have;
From above table, we see that each orbital have disconnected orbital
regular graph, except last orbital, .
Example 2. Consider a finite solvable group
of elements
and order two elements are .
Hence, contains
elements.
If we take the orbital , and i is even. By applying
regular action on the orbital we see that only the element acts on it, that is
Therefore, the orbital of size four contains connected orbital
regular graph of four vertices, . Figure 4 shows the orbital
regular graph for and Figure 5 shows
the orbital regular graph for . Figure 1 shows
the orbital regular graph for .
Figure 4. Orbital Regular Graph for
Next if we take different orbital , we produce the
connected orbital regular graph of three vertices.
Figure 5. Orbital regular graph for
Again, if we have orbital , and is even. We get three orbitals where
two orbitals have size two and one orbital have size four. This implies,
.
Figure 6. Orbital Regular Graph for
Here, we can produce the orbital regular graph for the rest of
the orbitals and found that different orbitals of group have different graph.
Theorem 4. For a symmetric group , and is even, each orbital of a group have connected orbital regular graph
except some orbitals which have disconnected graph with complete
components.
Proof. For , there
is diagonal orbital of group .
This implies that the graph is empty.
For , If acts regularly on then
there exist such that . The
vertex joined the
vertex whenever .
According to [2] the elements
of are in the form
Based on regular action, there are orbitals of size one, five orbitals of
size two and four orbitals of size four. Therefor, in the orbital of the
form , the
vertices of the form are
adjacent to the vertices of the form . Hence,we found that the orbital
regular graph for the orbital is connected graph of two vertices, . Similarly, for the remaining orbitals of size one, we have . However,
for the orbitals , and there
are four vertices in each orbital and each vertex is adjacent to their
next vertex to form a closed path, that is This
implies, .
Next, for the orbital of the form , and , we found that
each orbitals contain connected graph of three vertices;
Exception
Consider an orbitals of the type and of size two,
we found that there are four vertices in each orbitals. If acts regularly on the set then each orbital form two pairs
of connected graph
but there is no edge between two pairs which shows that both the pairs
are disconnected. This implies, .
The Orbital regular graph for and is presented
in Figure 7.
Figure 7. Orbital regular graph for and
Theorem 5. For a Symmetric group , is odd, each orbital have .
Proof. Since is odd,
the number of elements in
are in the form . Based on regular action on there are three central orbitals
of size one, that is
This implies that each orbital have two adjacent vertices which
follows that each orbital have .
Theorem 6. Let , is even. Let .
If acts regularly on . Then
Orbitals
, ,
,
, ,
,
,
and
3
,
Proof. Based on Theorem 2, for orbital
, and there are , complete
components of and connected component of four
vertices then the number of edges can be computed as follows: Next, for there are complete component of
, then Now, for orbital ,
and there are one
complete component of and one complete
component of . Hence it
follows that and for orbital , there are connected graph of three
vertices. Thus
Theorem 7. 1] Let , is even. Let .
If acts regularly on . Then
Orbitals
,
,
,
,
1
,
,
1
,
,
(exception)
2
,
,
(exception)
1
Proof. Based on Theorem 3, we consider each
case to compute number of edges of each orbital.
Case I
We found that for the orbital , there are
, connected graph of four vertices.
This implies that Also, for
there are connected graph
of three vertices. Thus,
Case II
Consider
and , then . This
implies
Case III
For ,
we found that each orbital have , component of and one connected
component of four vertices. Thus, we have This case follows the exception, i.e., there
exist one orbital of the type which
always have one component of , then
Case IV
For orbital , we
find and (exception) ,
we have
4. Conclusion
In this research, we computed the orbitals of a group using a regular
action to derive the orbital regular graph of some finite solvable
groups. The cartesian product of the set of all pairs of commuting
elements of size two in with
itself is used to obtain the orbitals of a group. We found the number of
orbital edges for each orbital of a finite solvable group. We also
observed that each group orbital
does have a different orbital regular graph.
Conflict of
Interest
The authors declare no conflict of interest.
References:
Goodman, F. M., 2002. Algebra Abstract and Concrete Stressing Symmetry (2nd ed.). Prentice Hall.[Google Scholor]
Omer, S. M. S., Sarmin, N. H., and Erfanian, A., 2014. The orbit graph for some finite solvable groups. AIP Conference Proceedings, 863.[Google Scholor]
Fang, X. C., Li, C. H., and Praeger, C. E., 1998. On orbital regular graphs and Frobenius graphs. Discrete Mathematics, 182(1-3), pp.85-99.[Google Scholor]
Smith, S. M., 2007. Orbital digraphs of infinite primitive permutation groups. Journal of Group Theory, 14(6), pp.817-828.[Google Scholor]
Li, C. H., Lu, Z. P., and Marusic, D., 2004. On primitive permutation groups with small suborbits and their orbital graphs. Journal of Algebra, 279(2), pp.749-770.[Google Scholor]
Sheikh, A., 2017. Orbital diameter of the symmetric and alternating groups. Journal of Algebraic Combinatorics, 45(1), pp.1-32.[Google Scholor]
Besenk, M., 2018. The action of on hyperbolic 3-space and orbital graphs. Graphs and Combinatorics, 34(3), pp.545-554.[Google Scholor]
Nagnibeda, T., Perez, A. and Schreier, G., 2021. Schreier graphs of spinal groups. International Journal of Algebra and Computation, 31(6), pp.1191-1216.[Google Scholor]
Pogorelov, B. A., and Pudovkina, M. A., 2020. Classification of distance-transitive orbital graphs of overgroups of the Jevons group. Discrete Mathematics and Applications, 30(1), pp.7-22.[Google Scholor]
Rekvenyi, K., 2021. On the orbital diameter of groups of diagonal type. arXiv preprint arXiv:2102.09867.[Google Scholor]
Hoffmann, R., 1971. Interaction of orbitals through space and through bonds. Accounts of Chemical Research, 4(1), pp.1-9.[Google Scholor]
King, R. B., 2020. Systematics of atomic orbital hybridization of coordination polyhedra: Role of f orbitals (Doctoral dissertation, University of Georgia).[Google Scholor]
Rahaman, O., and Gagliardi, A., 2020. Deep learning total energies and orbital energies of large organic molecules using hybridization of molecular fingerprints. Journal of Chemical Information and Modeling, 60(12), pp.5971-5983.[Google Scholor]
Sole, P., 1994. The edge-forwarding index of orbital regular graphs. Discrete Mathematics, 130(1-3), pp.171-176.[Google Scholor]
Rotman, J. J., 2002. Advanced Modern Algebra (1st ed.). Prentice Hall.[Google Scholor]