Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903066 | Discrete Mathematics | 2018 | 5 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu,