Non-Conjugate Graphs Associated With Finite Groups
Let <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula> be a finite group and <inline-formula> <tex-math notation="LaTeX">$S$ </tex-math></inline-formula> be a non-empty subset of <inline-formula> <...
Main Authors: | Hanan Alolaiyan, Awais Yousaf, M. Ameer, Abdul Razaq |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8817927/ |
Similar Items
-
ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH
by: Iqbal M. Batiha, et al.
Published: (2024-09-01) -
On lower bounds for the metric dimension of graphs
by: Mohsen Jannesari
Published: (2023-01-01) -
Maximal resolving sets in a graph
by: V. Swaminathan, et al.
Published: (2024-12-01) -
Metric dimension of fullerene graphs
by: Shehnaz Akhter, et al.
Published: (2019-04-01) -
Perfectness of the essential graph for modules over commutative rings
by: Fatemeh Soheilnia, et al.
Published: (2025-02-01)