Publication details
Equipartite graphs
| Authors | |
|---|---|
| Year of publication | 2008 |
| Type | Article in Periodical |
| Magazine / Source | Israel Journal of Mathematics |
| Citation | |
| Doi | http://dx.doi.org/10.1007/s11856-008-1071-5 |
| Description | A graph G of even order is weakly equipartite if for any partition of its vertex set into subsets V(1) and V(2) of equal size the induced subgraphs G[V(1)] and G[V(2)] are isomorphic. A complete characterization of (weakly) equipartite graphs is derived. In particular, we show that each such graph is vertex-transitive. In a subsequent paper, we use these results to characterize equipartite polytopes, a geometric analogue of equipartite graphs. |