On the dominating number, independent number and the regularity of the relative co-prime graph of a group
Let H be a subgroup of a finite group G. The co-prime graph of a group is defined as a graph whose vertices are elements of G and two distinct vertices are adjacent if and only if the greatest common divisor of order of x and y is equal to one. This concept has been extended to the relative co-prime...
Saved in:
Main Authors: | Abd. Rhani, N., Mohd. Ali, N. M., Sarmin, N. H., Erfanian, A. |
---|---|
Format: | Article |
Published: |
Penerbit UTM Press
2017
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/80920/ http://dx.doi.org/10.11113/mjfas.v13n2.602 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Power Dominating Numbers In Graphs
by: Chan, Kar Man
Published: (2021) -
Domination polynomial of the commuting and noncommuting graphs of some finite nonabelian groups
by: Najmuddin, N., et al.
Published: (2019) -
Independence polynomial of the commuting and noncommuting graphs associated to the quasidihedral group
by: Najmuddin, N., et al.
Published: (2021) -
Co-prime and relative co-prime probability for nonabelian metabelian groups of order at most 24 with their related graphs
by: Zulkifli, Nurfarah
Published: (2019) -
The Co-Prime Probability of p-Groups / Norarida Abdul Rhani ...[et al.]
by: Abd Rhani, Norarida, et al.
Published: (2019)