Compact graphs and equitable partitions

DOI10.1016/S0024-3795(97)83595-1MaRDI QIDQ677814zbMATH OpenOpenAlexFDO

Authors Chris 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

adjacency matrixautomorphismdoubly-stochastic matricescompact regular graphs

Mathematics Subject Classification ID

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

Recommendations

• On compact graphs
• A note on compact graphs
• The compactness of graph about complete graphs
• Compact cellular algebras and permutation groups
• Two results of the compact graph and its applications

Cites work

• scientific article; zbMATH DE number 3760444 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• A note on certain subpolytopes of the assignment polytope associated with circulant graphs
• A note on compact graphs
• An Efficient Algorithm for Graph Isomorphism
• Feasibility conditions for the existence of walk-regular graphs
• Graph isomorphism and theorems of Birkhoff type
• Problems in algebraic combinatorics
• Some applications of doubly stochastic matrices

Cited in

(37)

• Joins of hypergraphs and their spectra
• Controlling consensus in networks with symmetries
• Modeling Polarity-Driven Laminar Patterns in Bilayer Tissues with Mixed Signaling Mechanisms
• On Tinhofer's linear programming approach to isomorphism testing
• On the power of color refinement
• Parabolic theory of the discrete \(p\)-Laplace operator
• The compactness of graph about complete graphs
• A characterization and an application of weight-regular partitions of graphs
• On the status sequences of trees
• Perfect 2-coloring of the quartic graphs with order at most 8
• Graph isomorphism, color refinement, and compactness
• Compact cellular algebras and permutation groups
• Equipartitions of graphs
• Infinite families of directed strongly regular graphs using equitable partitions
• On compact symmetric regularizations of graphs
• scientific article; zbMATH DE number 7009673 (Why is no real title available?)
• scientific article; zbMATH DE number 7563313 (Why is no real title available?)
• Block transitivity and degree matrices
• Graph isomorphism and theorems of Birkhoff type
• Perfect 2-colorings of the cubic graphs of order less than or equal to 10
• Constructing cospectral signed graphs
• Perfect 3-colorings on 6-regular graphs of order 9
• Edge-matching graph contractions and their interlacing properties
• Characterizing and computing weight-equitable partitions of graphs
• Perfect 2-colorings of the generalized Petersen graph
• A short update on equipackable graphs
• scientific article; zbMATH DE number 7289053 (Why is no real title available?)
• Perfect 2-colorings of \(C_n \times C_m\)
• Perfect 3-colorings of the cubic graphs of order 10
• Permutational powers of a graph
• Perfect 2-colorings of the generalized Petersen graph \(GP(n,3)\)
• On compact graphs
• Relational linear programming
• On perfect colorings of infinite multipath graphs
• Two results of the compact graph and its applications
• Pattern polynomial graphs
• Minimum fractional dominating functions and maximum fractional packing functions

This page was built for publication: Compact graphs and equitable partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677814)