Degree-equipartite graphs

DOI10.1016/J.DISC.2011.02.018zbMATH Open1223.05223arXiv1108.1606OpenAlexW2007771602MaRDI QIDQ534061FDOQ534061

Authors: M. H. Shirdareh Haghighi, Khodakhast Bibak 

Publication date: 10 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

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].

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

Recommendations

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

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)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Equipartite graphs
• A Class of Graphs
• Degree-equipartite graphs

Cited In (4)

• Digraphs with degree equivalent induced subdigraphs
• Degree-equipartite graphs
• Equipartite graphs
• A new characterization of 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)