Name
Abstract | ||
|---|---|---|
The decycling number of a graph G is the minimum number of vertices whose removal from G results in an acyclic subgraph. In this paper we show that the decycling number f ( n ) of the bubble sort graph B n satisfies these inequalities: n ! ( n - 3 ) 2 ( n - 2 ) + 1 ¿ f ( n ) ¿ n ! ( 2 n - 3 ) 4 ( n - 1 ) . |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.dam.2015.05.024 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Graph theory,Decycling set,Decycling number,Bubble sort graphs,Cycles,Acyclic subgraph,Networks | Graph theory,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Bubble sort,Mathematics | Journal |
Volume | Issue | ISSN |
194 | C | 0166-218X |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Wang | 1 | 73 | 16.74 |
| Xirong Xu | 2 | 44 | 13.81 |
| Liqing Gao | 3 | 5 | 1.86 |
| Sijia Zhang | 4 | 0 | 0.68 |
| Yuansheng Yang | 5 | 80 | 24.02 |