Name
Abstract | ||
|---|---|---|
In Mader (2010), Mader conjectured that for every positive integer k and every finite tree T with order m, every k-connected, finite graph G with δ(G)≥⌊32k⌋+m−1 contains a subtree T′ isomorphic to T such that G−V(T′) is k-connected. In the same paper, Mader proved that the conjecture is true when T is a path. Diwan and Tholiya (2009) verified the conjecture when k=1. In this paper, we will prove that Mader’s conjecture is true when T is a star or double-star and k=2. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.disc.2017.10.017 | Discrete Mathematics |
Keywords | Field | DocType |
2-Connected graphs,Stars,Double-stars,Mader’s conjecture | Graph theory,Integer,Discrete mathematics,Graph,Combinatorics,Stars,Tree (data structure),Isomorphism,Conjecture,A* search algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
341 | 4 | 0012-365X |
Citations | PageRank | References |
1 | 0.40 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yingzhi Tian | 1 | 20 | 9.28 |
| Jixiang Meng | 2 | 353 | 55.62 |
| Hongjian Lai | 3 | 4 | 2.42 |
| Liqiong Xu | 4 | 16 | 11.04 |