59 citations · 338 across the 95 of their papers we have counts for
8 papers · 1 filter
Number of spanning trees containing a given forest
Peter J. Cameron, Michael Kagan
We consider all spanning trees of a complete simple graph on vertices that contain a given forest . We show that the number of such spanning trees, , doesn't d…
Component graphs of vector spaces and zero-divisor graphs of ordered sets
Nilesh Khandekar, Peter J. Cameron, Vinayak Joshi
In this paper, nonzero component graphs and nonzero component union graphs of finite dimensional vector space are studied using the zero-divisor graph of specially constructed 0-1-…
Association schemes with given stratum dimensions: on a paper of Peter M. Neumann
Marina Anagnostopoulou-Merkouri, Peter J. Cameron
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p". The main theorem placed restrictions on the parameters of a primitive but not…
Generalized non-coprime graphs of groups
S. Anukumar Kathirvel, Peter J. Cameron, T. Tamizh Chelvam
Let G be a finite group with identity e and H \neq \{e\} be a subgroup of G. The generalized non-coprime graph GAmma_{G,H} of G with respect to H is the simple undirected graph wit…
Induced subgraphs of zero-divisor graphs
G. Arunkumar, Peter J. Cameron, T. Kavaskar +1
The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with and adjacent if . We show t…
Enhanced power graphs of groups are weakly perfect
Peter J. Cameron, Veronica Phan
A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group is weakly perfect: its clique number and…