Degree-equipartite graphs

作者：Bibak Kh^*; Haghighi M H Shirdareh

来源：Discrete Mathematics, 2011, 311(10-11): 888-891.

DOI：10.1016/j.disc.2011.02.018

• Degree-equipartite graph
• Equipartite graph
• Spectral-equipartite graph
• Weakly equipartite graph

A graph G of order 2n is called degree-equipartite if for every n-element set A subset of V (G), the degree sequences of the induced subgraphs G[A] and G[V(G)\A] are the same. In this paper, we characterize all degree-equipartite graphs. This answers Problem 1 in the paper by Grunbaum et al. [B. Grunbaum, T. Kaiser, D. Kral, and M. Rosenfeld, Equipartite graphs, Israel J. Math. 168 (2008) 431-444].

• 出版日期2011-6-6