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).
Let G be a finite group and X be a G-conjugacy of elements of order 3. The A4-graph of G is a simple graph with vertex set X and two vertices x,yÎX are linked if x≠ y and xy-1 is an involution element. This paper aims to investigate the A4-graph properties for the monster Held group He.
Let G be a finite group and X be a conjugacy class of order 3 in G. In this paper, we introduce a new type of graphs, namely A4-graph of G, as a simple graph denoted by A4(G,X) which has X as a vertex set. Two vertices, x and y, are adjacent if and only if x≠y and x y-1=y x-1. General properties of the A4-graph as well as the structure of A4(G,X) when G@ 3D4(2) will be studied.
(6)
(1)
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.
(6)
(3)
For a finite group G, the intersection graph of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph of subgroups of the dihedral group for distinct primes . We also find the mean distance of the graph .
(3)
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.
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)
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.
A graph
is said to be singular if and only if its adjacency matrix is singular. A graph
is said to be bipartite graph if and only if we can write its vertex set as
, and each edge has exactly one end point in
and other end point in
. In this work, we will use graphic permutation to find the determinant of adjacency matrix of bipartite graph. After that, we will determine the conditions that the bipartite graph is singular or non-singular.
This work aims to introduce and to study a new kind of divisor graph which is called idempotent divisor graph, and it is denoted by . Two non-zero distinct vertices v1 and v2 are adjacent if and only if , for some non-unit idempotent element . We establish some fundamental properties of , as well as it’s connection with . We also study planarity of this graph.
(3)
(2)