Coset Graphs on Finite Groups.

Saved in:
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 194195892
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Coset Graphs on Finite Groups.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Easwaran%2C+K%2E%22">Easwaran, K.</searchLink><relatesTo>1</relatesTo><i> easwark2010@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Kamaraj%2C+M%2E%22">Kamaraj, M.</searchLink><relatesTo>2</relatesTo><i> kamarajm17366@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Christopher%2C+A%2E+David%22">Christopher, A. David</searchLink><relatesTo>3</relatesTo><i> davidchristopher@americancollege.edu.in</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IAENG+International+Journal+of+Applied+Mathematics%22">IAENG International Journal of Applied Mathematics</searchLink>. Jun2026, Vol. 56 Issue 6, p2026-2034. 9p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Finite+groups%22">Finite groups</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+symmetry%22">Mathematical symmetry</searchLink><br /><searchLink fieldCode="DE" term="%22Hamiltonian+graph+theory%22">Hamiltonian graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Dominating+set%22">Dominating set</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+connectivity%22">Graph connectivity</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=194195892
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 9
        StartPage: 2026
    Subjects:
      – SubjectFull: Finite groups
        Type: general
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Mathematical symmetry
        Type: general
      – SubjectFull: Hamiltonian graph theory
        Type: general
      – SubjectFull: Dominating set
        Type: general
      – SubjectFull: Graph connectivity
        Type: general
    Titles:
      – TitleFull: Coset Graphs on Finite Groups.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Easwaran, K.
      – PersonEntity:
          Name:
            NameFull: Kamaraj, M.
      – PersonEntity:
          Name:
            NameFull: Christopher, A. David
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 19929978
          Numbering:
            – Type: volume
              Value: 56
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: IAENG International Journal of Applied Mathematics
              Type: main
ResultId 1