Connectivity keeping trees in 3-connected or 3-edge-connected graphs - Details

author：

Liu, H. (Liu, H..) ^[1] | Liu, Q. (Liu, Q..) ^[2] (Scholars：刘清海) | Hong, Y. (Hong, Y..) ^[3] (Scholars：洪艳梅)

Indexed by：

Scopus

Abstract：

Hasunuma　conjectured　that　for　any　tree　of　order　m　and　for　any　k-connected　(resp.　k-edge-connected)　graph　G,　if　δ(G)≥k+m−1　then　G　contains　a　subgraph　H≅T　such　that　G−E(H)　is　k-connected　(resp.　k-edge-connected).　Hasunuma　verified　the　conjecture　for　k=1,2.　In　this　paper,　we　confirm　the　conjecture　when　k=3.　©　2023　Elsevier　B.V.

Keyword：

Connectivity Subdivision Trees

Community：

[ 1 ] [Liu H.]Center for Discrete Mathematics, Fuzhou University, Fujian, Fuzhou, 350108, China
[ 2 ] [Liu Q.]Center for Discrete Mathematics, Fuzhou University, Fujian, Fuzhou, 350108, China
[ 3 ] [Liu Q.]Fujian Science & Technology Innovation Laboratory for Optoelectronic Information of China, Fujian, Fuzhou, China
[ 4 ] [Liu Q.]Center for Applied Mathematics of Fujian Provincen, Fuzhou, 350108, China
[ 5 ] [Hong Y.]School of Mathematics and Statistics, Fuzhou University, Fujian, Fuzhou, 350108, China
[ 6 ] [Hong Y.]Center for Applied Mathematics of Fujian Provincen, Fuzhou, 350108, China

Reprint 's Address：

Email：

Show more details

Related Keywords：

Connectivity keeping trees in 3-connected or 3-edge-connected graphs
2023，DISCRETE MATHEMATICS
Connectivity keeping caterpillars and spiders in 2-connected graphs
2021，DISCRETE MATHEMATICS
Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity
2021，THEORETICAL COMPUTER SCIENCE
Connectivity for some families of composition networks
2022，THEORETICAL COMPUTER SCIENCE
A reappraisal of the ink-bottle effect and pore structure of cementitious materials using intrusion-extrusion cyclic mercury porosimetry
2022，CEMENT AND CONCRETE RESEARCH

Source ：

Discrete Mathematics

ISSN： 0012-365X

Year： 2023

Issue： 12

Volume： 346

0 . 7

JCR@2023

0 . 7 0 0

JCR@2023

JCR Journal Grade：2

CAS Journal Grade：3

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count：

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 3

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to