• Publications
  • Influence
Pursuit-evasion in a graph
  • 521
  • 24
Isomorphism of circulant graphs and digraphs
We prove the conjecture true if n = pq where p and q are distinct primes. Expand
  • 125
  • 10
1. Introduction. A useful general strategy for the construction of interesting families of vertex-transitive graphs is to begin with some family of transitive permutation groups and to construct forExpand
  • 104
  • 9
  • PDF
Graphs from Projective Planes
The orthogonality relation among subspaces of a finite vector space is studied here by means of the corresponding graph. In the case we consider, this graph has some highly symmetric inducedExpand
  • 35
  • 7
Path-cycle Ramsey numbers
In this paper, the Ramsey numbers are obtained for all path-cycle pairs. Expand
  • 50
  • 6
Ramsey graphs and block designs. I
  • 28
  • 4
Path-Star Ramsey numbers
Abstract Let f ( m , n ) be the least integer N such that for every graph G with N vertices, either G contains a path of m vertices or the complement of G contains a vertex of degree at least n .Expand
  • 32
  • 3
Ramsey Graphs and Block Designs
  • T. D. Parsons
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 1976
Symmetric (ν, κ, λ)-block designs admitting polarity maps are shown to be closely related to certain Ramsey numbers for bipartite graphs. Expand
  • 28
  • 2
  • PDF
On Hamiltonian Cycles in Metacirculant Graphs
In this paper it is shown that every connected metacirculant with an odd number of vertices greater than one and with blocks of prime cardinality has a hamiltonian cycle.
  • 14
  • 2
The Ramsey numbers r(Pm, Kn)
This note evaluates the Ramsey numbers r(P"m,K"n), and discusses developments in 0 generalized Ramsey theory for graphs. Expand
  • 28
  • 1