Compact graphs and equitable partitions

DOI10.1016/S0024-3795(97)83595-1zbMath0872.05033OpenAlexW2074849196MaRDI QIDQ677814

Chris D. Godsil

Publication date: 16 April 1997

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(97)83595-1

zbMATH Keywords

automorphismadjacency matrixdoubly-stochastic matricescompact regular graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Stochastic matrices (15B51)

Related Items

Characterizing and computing weight-equitable partitions of graphs, Controlling consensus in networks with symmetries, Perfect 2-colorings of the generalized Petersen graph, Perfect 2-colorings of the generalized Petersen graph GP(n,3), Perfect 2-coloring of the quartic graphs with order at most 8, Graph isomorphism, color refinement, and compactness, On Tinhofer’s Linear Programming Approach to Isomorphism Testing, Parabolic theory of the discrete \(p\)-Laplace operator, On the Power of Color Refinement, A characterization and an application of weight-regular partitions of graphs, Modeling Polarity-Driven Laminar Patterns in Bilayer Tissues with Mixed Signaling Mechanisms, Joins of hypergraphs and their spectra, Unnamed Item, On the status sequences of trees, On perfect colorings of infinite multipath graphs, Edge-matching graph contractions and their interlacing properties, Perfect 2-colorings of the cubic graphs of order less than or equal to 10, Relational linear programming, Unnamed Item, Constructing cospectral signed graphs, Minimum fractional dominating functions and maximum fractional packing functions, Perfect 3-colorings on 6-regular graphs of order 9, Unnamed Item, Unnamed Item, Compact cellular algebras and permutation groups, Permutational powers of a graph, Perfect 3-colorings of the cubic graphs of order 10, On compact graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on certain subpolytopes of the assignment polytope associated with circulant graphs
• Graph isomorphism and theorems of Birkhoff type
• Some applications of doubly stochastic matrices
• Feasibility conditions for the existence of walk-regular graphs
• A note on compact graphs
• Problems in algebraic combinatorics
• An Efficient Algorithm for Graph Isomorphism