- Tytuł:
- The Bipartite-Splittance of a Bipartite Graph
- Autorzy:
-
Yin, Jian-Hua
Guan, Jing-Xin - Powiązania:
- https://bibliotekanauki.pl/articles/31343732.pdf
- Data publikacji:
- 2019-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
degree sequence pair
bipartite-split graph
bipartite-splittance - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 1; 23-29
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł