### AIMS Mathematics

2021, Issue 6: 5762-5771. doi: 10.3934/math.2021340
Research article

# The k-subconnectedness of planar graphs

• Received: 13 November 2020 Accepted: 01 March 2021 Published: 26 March 2021
• MSC : 05C40, 05C85

• A graph $G$ with at least $2k$ vertices is called k-subconnected if, for any $2k$ vertices $x_{1}, x_{2}, \cdots, x_{2k}$ in $G$, there are $k$ independent paths joining the $2k$ vertices in pairs in $G$. In this paper, we prove that a k-connected planar graph with at least $2k$ vertices is k-subconnected for $k = 1, 2$; a 4-connected planar graph is k-subconnected for each $k$ such that $1\leq k\leq \nu /2$, where $v$ is the number of vertices of $G$; and a 3-connected planar graph $G$ with at least $2k$ vertices is k-subconnected for $k = 4, 5, 6$. The bounds of k-subconnectedness are sharp.

Citation: Zongrong Qin, Dingjun Lou. The k-subconnectedness of planar graphs[J]. AIMS Mathematics, 2021, 6(6): 5762-5771. doi: 10.3934/math.2021340

### Related Papers:

• A graph $G$ with at least $2k$ vertices is called k-subconnected if, for any $2k$ vertices $x_{1}, x_{2}, \cdots, x_{2k}$ in $G$, there are $k$ independent paths joining the $2k$ vertices in pairs in $G$. In this paper, we prove that a k-connected planar graph with at least $2k$ vertices is k-subconnected for $k = 1, 2$; a 4-connected planar graph is k-subconnected for each $k$ such that $1\leq k\leq \nu /2$, where $v$ is the number of vertices of $G$; and a 3-connected planar graph $G$ with at least $2k$ vertices is k-subconnected for $k = 4, 5, 6$. The bounds of k-subconnectedness are sharp. ###### 通讯作者: 陈斌, bchen63@163.com
• 1.

沈阳化工大学材料科学与工程学院 沈阳 110142 2.2 3

Article outline

## Other Articles By Authors

• On This Site  DownLoad:  Full-Size Img  PowerPoint