A Combinatorial Property and Power Graphs of Groups
By Andrei V. Kelarev, Stephen Quinn. 2000
212 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/4d3d3661a65f7db075a91820efbf53bc57549713
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Zeinab Mehranian
- Peter J. Cameron
- Ahmad Gholami
- Andrei V. Kelarev
- Ali Reza Ashrafi
- Stephen Quinn
- Pierre Baldi
- B. Douglas
Citations in the corpus
- Power graphs and semigroups of matrices (2001, unknown): “[9] Let D = {V,E) be a graph with E / 0 and let H be an infinite group.”
- A combinatorial property and Cayley graphs of semigroups (2002, methodology): “In [10] the authors described all groups G and graphs D such that G is power D-saturated.”
- A combinatorial property and power graphs of semigroups (2004, methodology): “A new combinatorial property was introduced in [10] using power graphs.”
- Graphs defined on groups (2021, methodology): “The power graph was introduced by Kelarev and Quinn [71].”
- A note on the power graph of a finite group (2016, background): “These graphs were introduced in [6], see also [10, 11, 12].”
- The Spectra of power graphs of certain finite groups (2017, methodology): “Kelarev, Quinn and Smolíková [4] gave a complete description of all infinite matrix semigroups satisfying a certain combinatorial property defined in terms of power graphs.”