On the intersection power graph of a finite group
Given a group G, the intersection power graph of G, denoted by GI(G), is the graph with vertex set G and two distinct vertices x and y are adjacent in GI(G) if there exists a non-identity element z ∈ G such that xm=z=yn, for some m, n ∈ N, i.e. x ∼ y in GI(G) if ⟨x⟩ ∩ ⟨y⟩ ≠ {e} and e is adjacent to...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-04-03.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |