Sep 2026· Journal of Mathematical & Computer Applications· Vol 5, pp. 1· 0 citations
Abstract
The first two authors have introduced a new class of graphs associated with the elements of unequal order in the group of residue classes modulo , an integer. It is established that it is a connected graph and the vertex degree and size of the graph are determined. In this paper, it is shown that is Hamiltonian if is even. Further, it is proved that it is not a complete graph and it is a complete multipartite graph. The formula for the number of triangles in is determined.
The power graph is defined as a graph whose vertexset consists of the elements of a group, where two vertices arejoined by an edge if one element is a power of the other. In thisresearch we discuss the power graph of a cyclic group of order n=pq, with p and q distinct prime numbers, illustrates theconnectivity among it...
Riyanto, Arif Munandar· International Journal of Com...· 0 citations
The Hurwitz graph has as its vertices the maximal chains in the lattice of non-crossing partitions, with an edge between two chains which differ at exactly one place. Adin and Roichman introduced an order on this graph by choosing a base element and showed that the maximal elements are counted by the Catalan numbers. W...
P. Biane· Groups, Geometry, and Dynami...· 0 citations
This paper introduces the inverse-order divisor graph associated with a finite group G, a hybrid graph obtained by combining the adjacency conditions of the order-divisor graph and the classical inverse graph. Our primary focus is on the additive cyclic group of order 2p, where p denotes an odd prime. By partitioning t...
Onjefu Amali, A. Akwu, P. A. Ejegwa et al.· Journal of the Nigerian Soci...· 0 citations
We construct an explicit DG algebra structure on the minimal free resolution of the quotient of a polynomial ring by the edge ideal of any split graph (that is, a graph whose vertex set is a disjoint union of a clique and an independent set). The algebra structure is based on a simple combinatorial notion, which we cal...
David Bronshvayg, Rachel N. Diethorn, Mario Stinson-Maas et al.· 0 citations
A graph G is called a chain graph if it contains none of the graphs {2K2,C3,C5} as induced subgraphs. It is said to be almost controllable if it has exactly one non-main eigenvalue, that is, precisely one eigenvalue whose corresponding eigenspace is orthogonal to the all-ones vector. Within the class of chain graphs, w...
B. Alshamary, M. Andelic· Malaysian journal of mathema...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.