On the Decycling Number of Bubble-sort Star Graphs
From MaRDI portal
Publication:6368296
Abstract: Bubble-sort star graphs are a combination of star graphs and bubble sort graphs. They are bipartite graphs and also form a family of Cayley graphs. The decycling number of a graph is the minimum number of vertices whose removal from the graph results in an acyclic subgraph. In this paper, we prove the decycling number D(n) of an n-dimensional bubble-sort star graph for n <= 5. We also show D(n) satisfies the inequalities for n >= 6.
This page was built for publication: On the Decycling Number of Bubble-sort Star Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6368296)
