Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
In order to construct decycling sets of bubble sort graphs, we discuss a method of describing a permutation by means of its inversion sequences. Let ...
May 22, 2021 · 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 ...
Request PDF | Decycling bubble sort graphs | The decycling number of a graph is the minimum number of vertices whose removal from results in an acyclic ...
May 22, 2021 · 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 ...
Oct 30, 2015 · The decycling number of a graph G is the minimum number of vertices whose removal from G results in an acyclic subgraph.
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.
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.
In this paper, we prove the decycling number D(n) of an n-dimensional bubblesort star graph for n 6 5. We also show D(n) satisfies the inequalities for n > 6 ...
planar graphs, bipartite graphs and perfect graphs ... graphs, bubble sort graphs, Fibonacci cubes, and ... decycling sets generated by our algorithm for star ...