Assume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).
In this work, a deep computational study has been conducted to assign several qualities for the graph . Furthermore, determine the amount of the dihedral subgroups in the Held simple group He through utilizing the attributes of gamma.
The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.
(13)
(5)
For the graph , the behavior associated with to the majority of the graphical properties of this graph is covered in this article. The reflection of the capabilities of on the Ly constructions is one of the key ideas addressed throughout this paper. For instance, by this technique we can comprehend the mechanism via which groups of relatively tiny structure are exist within Ly.
Assume that G ≅ HN the Harada–Norton group. In this paper, effective investment for the graph ΓRI HN standard features to acquire meaningful algebraic results for the graph ΓRI HN and its corresponding group HN. For instance, marketing a modern methods to understand the way of create a precise small subgroups in G. Furthermore, performing a full investigation for getting particular ΓRI HN parameters.
Indexes of topological play a crucial role in mathematical chemistry and network theory, providing valuable insights into the structural properties of graphs. In this study, we investigate the Resize graph of G2(3), a significant algebraic structure arising from the exceptional Lie group (G2) over the finite field F3. We compute several well-known topological indices, including the Zagreb indices, Wiener index, and Randić index, to analyze the graph's connectivity and complexity. Our results reveal intricate relationships between the algebraic structure of G2(3) and its graphical properties, offering a deeper understanding of its combinatorial and spectral characteristics. These findings contribute to the broader study of algebraic graph t
... Show More
(6)
The main objective of this paper is to find the order and its exponent, the general form of all conjugacy classes, Artin characters table and Artin exponent for the group of lower unitriangular matrices L(3,? p ), where p is prime number.
Topological indices provide important insights into the structural characteristics of molecular graphs. The present investigation proposes and explores a creative graph on a finite group G, which is known as the RIG. This graph is designated as ΓRS G2(4) indicating a simple undirected graph containing elements of G. Two distinct ertices are regarded as nearly the same if and only if their sum yields a non-trivial involution element in G. RIGs have been discovered in various finite groups. We examine several facets of the RIG by altering the graph through the conjugacy classes of G. Furthermore, we investigate the topological indices as applications in graph theory applying the distance matrix of the G2(4) group.
Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.
(1)
Advances in digital technology and the World Wide Web has led to the increase of digital documents that are used for various purposes such as publishing and digital library. This phenomenon raises awareness for the requirement of effective techniques that can help during the search and retrieval of text. One of the most needed tasks is clustering, which categorizes documents automatically into meaningful groups. Clustering is an important task in data mining and machine learning. The accuracy of clustering depends tightly on the selection of the text representation method. Traditional methods of text representation model documents as bags of words using term-frequency index document frequency (TFIDF). This method ignores the relationship an
... Show More
(15)