Compact graphs and equitable partitions (Q677814)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Compact graphs and equitable partitions
scientific article

    Statements

    Compact graphs and equitable partitions (English)
    0 references
    16 April 1997
    0 references
    Let \(\Gamma\) and \(S(A)\) be the sets of permutation and doubly-stochastic matrices, respectively, which commute with the adjacency matrix \(A\) of a graph \(G\). A graph \(G\) is called compact if every matrix from \(S(A)\) is a convex combination of matrices from \(\Gamma\). Graphs for which \(S(A)= \{I\}\) are characterized. It is proved that in compact regular graphs \(G\) any two vertices can be interchanged by an automorphism of \(G\).
    0 references
    doubly-stochastic matrices
    0 references
    adjacency matrix
    0 references
    compact regular graphs
    0 references
    automorphism
    0 references
    0 references

    Identifiers