Forbidden Subgraphs of Power Graphs
The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are connected by an edge between if and only if either $u=v^i$ or $v=u^j$ for some $i$, $j$. A number of important grap...
Saved in:
Published in | The Electronic journal of combinatorics Vol. 28; no. 3 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
02.07.2021
|
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!