Title of article
Degree-equipartite graphs
Author/Authors
Bibak، نويسنده , , Kh. and Shirdareh Haghighi، نويسنده , , M.H.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
4
From page
888
To page
891
Abstract
A graph G of order 2 n is called degree-equipartite if for every n -element set A ⊆ 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 Grünbaum et al. [B. Grünbaum, T. Kaiser, D. Král, and M. Rosenfeld, Equipartite graphs, Israel J. Math. 168 (2008) 431–444].
Keywords
Weakly equipartite graph , Degree-equipartite graph , Equipartite graph , Spectral-equipartite graph
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1598419
Link To Document