Degree-equipartite graphs

DOI10.1016/J.DISC.2011.02.018MaRDI QIDQ534061zbMATH OpenOpenAlexFDO

Authors M. H. Shirdareh Haghighi, Khodakhast Bibak

Publication date 10 May 2011

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.1606

zbMATH Keywords

equipartite graphdegree-equipartite graphspectral-equipartite graphweakly equipartite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: A graph $G$ of order $2n$ is called degree-equipartite if for every $n$-element set $AsubseteqV(G)$, the degree sequences of the induced subgraphs $G[A]$ and $G[V(G)setminusA]$ are the same. In this paper, we characterize all degree-equipartite graphs. This answers Problem 1 in the paper by Gr"{u}nbaum et al [B. Gr"{u}nbaum, T. Kaiser, D. Kr'{a}l, and M. Rosenfeld, Equipartite graphs, {it Israel J. Math.} {�f 168} (2008), 431-444].

Recommendations

• A new characterization of equipartite graphs
• Equipartite graphs
• Equipartitions of graphs
• scientific article; zbMATH DE number 4162938
• Degree equitable chromatic number of a graph

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• A Class of Graphs
• Degree-equipartite graphs
• Equipartite graphs
• Graph theory

Cited in

(4)

• Digraphs with degree equivalent induced subdigraphs
• A new characterization of equipartite graphs
• Degree-equipartite graphs
• Equipartite graphs

This page was built for publication: Degree-equipartite graphs

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