Article thumbnail

The Bipartite-Splittance of a Bipartite Graph

By Yin Jian-Hua and Guan Jing-Xin

Abstract

A bipartite-split graph is a bipartite graph whose vertex set can be partitioned into a complete bipartite set and an independent set. The bipartite- splittance of an arbitrary bipartite graph is the minimum number of edges to be added or removed in order to produce a bipartite-split graph. In this paper, we show that the bipartite-splittance of a bipartite graph depends only on the degree sequence pair of the bipartite graph, and an easily computable formula for it is derived. As a corollary, a simple characterization of the degree sequence pair of bipartite-split graphs is also given

Topics: degree sequence pair, bipartite-split graph, bipartite-splittance, 05C07, Mathematics, QA1-939
Publisher: Sciendo
Year: 2019
DOI identifier: 10.7151/dmgt.2057
OAI identifier: oai:doaj.org/article:bb1b7e61c2f147608ae4a08b92efeaca
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/article/bb1b7... (external link)
  • http://www.degruyter.com/view/... (external link)
  • https://doaj.org/toc/2083-5892 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.