Skip to content

Opening book details…

Can I read Compact Graphs and Equitable Partitions on EtoBox?

Compact Graphs and Equitable Partitions by C.D. Godsil is a Mathematics article available to read on EtoBox.

What is Compact Graphs and Equitable Partitions about?

Let G be a graph with adjacency matrix A, and let I-be the set of all permutation matrices which commute with A. We call G compact if every doubly stochastic matrix which commutes with A is a convex combination of matrices from I'. We characterize the graphs for which S( A) = {I} and show that the automorphism group of a compact regular graph is generously transitive, i.e., given any two vertices, there is an automorphism which interchanges them. We also describe a polynomial time algorithm for determining whether a regular graph on a prime number of vertices is compact.

Who reads Compact Graphs and Equitable Partitions?

It is typically read by researchers, students, and practitioners in Mathematics.

Author
C.D. Godsil
Publisher
Elsevier Science; Elsevier ; Elsevier BV (ISSN 0024-3795)
Published
1997
Language
EN
Field
Mathematics (Physical Sciences)

More by C.D. Godsil

Browse all works by C.D. Godsil