Bibliographic Details
| Title: |
Coset Graphs on Finite Groups. |
| Authors: |
Easwaran, K.1 easwark2010@gmail.com, Kamaraj, M.2 kamarajm17366@gmail.com, Christopher, A. David3 davidchristopher@americancollege.edu.in |
| Source: |
IAENG International Journal of Applied Mathematics. Jun2026, Vol. 56 Issue 6, p2026-2034. 9p. |
| Subjects: |
Finite groups, Graph theory, Mathematical symmetry, Hamiltonian graph theory, Dominating set, Graph connectivity |
| Abstract: |
Let A be a finite group, and 1 = {H1,H2, ..., Hn} a family of its subgroups. We define the coset graph, whose vertices are elements of A, where two distinct vertices are adjacent if they lie in the same left coset of some subgroup in. We study conditions under which, is complete or Hamiltonian and examine its structural properties, including domination number, connectivity, and regularity for particular choices of A an. [ABSTRACT FROM AUTHOR] |
|
Copyright of IAENG International Journal of Applied Mathematics is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
