Given a combinatorial designD with block set B, its traditional block-intersection graph GD is the graph having vertex set B such that two vertices b1 and b2 are adjacent if and only if b1 and b2â€¦ (More)

Let G be a finite simple graph of order n, maximum degree âˆ†, and minimum degree Î´. A compact regularization of G is a âˆ†-regular graph H of which G is an induced subgraph: H is symmetric if everyâ€¦ (More)