Genus and crosscap of normal subgroup based power graphs of finite groups
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3877215 (Why is no real title available?)
- scientific article; zbMATH DE number 2031101 (Why is no real title available?)
- scientific article; zbMATH DE number 2108136 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A novel method to construct NSSD molecular graphs
- Additivity of the genus of a graph
- An extension of \textit{Sylow}'s theorem.
- Blocks and the nonorientable genus of graphs
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Character theory of finite groups.
- Embeddings of (proper) power graphs of finite graphs
- Graphs on surfaces
- Nilpotent groups whose difference graphs have positive genus
- Normal subgroup based power graph of finite groups
- Normal subgroup based power graphs of a finite group
- On the power graph of a finite group
- Power graphs of (non)orientable genus two
- Recent developments on the power graph of finite groups -- a survey
- The graph genus problem is NP-complete
- The lambda number of the power graph of a finite \(p\)-group
- Verallgemeinerung des Sylow'schen Satzes.
- Über die Anzahl der eigentlichen Untergruppen und der Elemente von gegebener Ordnung in p-Gruppen
This page was built for publication: Genus and crosscap of normal subgroup based power graphs of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995110)