A matching is extendable in a graph G if G has a perfect matching containing it.A distance q matching is a matching such that the distance between any two distinct matching edges is at least q.In this paper,we prove t...A matching is extendable in a graph G if G has a perfect matching containing it.A distance q matching is a matching such that the distance between any two distinct matching edges is at least q.In this paper,we prove that any distance 2k-3 matching is extendable in a connected and locally(k-1)-connected K1,k-free graph of even order.Furthermore,we also prove that any distance q matching M in an r-connected and locally(k-1)-connected K1,k-free graph of even order is extendable provided that|M|is bounded by a function on r,k and q.Our results improve some results in[J.Graph Theory 93(2020),5–20].展开更多
In this article, we investigate the dynamical properties of fλ(z) =λzke2, for λ(≠0) ∈Cand k≥2. We will show that the boundaries of some (or all ) Fatou components are Jordan curves and the Julia sets are S...In this article, we investigate the dynamical properties of fλ(z) =λzke2, for λ(≠0) ∈Cand k≥2. We will show that the boundaries of some (or all ) Fatou components are Jordan curves and the Julia sets are Sierpinski carpet, and they are locally connected for some certain λ.展开更多
Let D■R2 be a Jordan domain,D*=R2\D,the exterior of D.In this article,the authors obtained the following results:(1)If D is a John disk,then D is an outer linearly locally connected domain;(2)If D* is a John disk,the...Let D■R2 be a Jordan domain,D*=R2\D,the exterior of D.In this article,the authors obtained the following results:(1)If D is a John disk,then D is an outer linearly locally connected domain;(2)If D* is a John disk,then D is an inner linearly locally connected domain;(3)A homeomorphism f:R 2 →R 2 is a quasiconformal mapping if and only if f(D)is a John disk for any John disk D■R 2 ;and(4)If D is a bounded quasidisk,then D is a John disk,and there exists an unbounded quasidisk which is not a John disk.展开更多
In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system(IFS). For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets ...In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system(IFS). For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets are connected, if and only if all the N graphs are connected; in this case, the invariant sets are all locally connected and path connected. Our result extends the results on the connectedness of the self-similar sets.展开更多
A circular thin plate is proposed for vibration attenuation,which is attached alternately by annular piezoelectric unimorphs with resonant shunt circuits.Two kinds of equal frequency resonant shunt circuits are design...A circular thin plate is proposed for vibration attenuation,which is attached alternately by annular piezoelectric unimorphs with resonant shunt circuits.Two kinds of equal frequency resonant shunt circuits are designed to achieve an integrated locally resonant(LR)band gap(BG) with a much smaller transmission factor:(1) the structure is arrayed periodically while the resonant shunt circuits are aperiodic;(2) the resonant shunt circuits are periodic while the structure is aperiodic.The transmission factor curve is calculated,which is validated by the finite element method.Dependences of the LR BG performance upon the geometric and electric parameters are also analyzed.展开更多
gives that every connected,locally connected K 1,4 free,almost claw free graph on at least three vertices is vertices pancyclic. This paper shows that every connected,locally 2 connected K 1,4 fr...gives that every connected,locally connected K 1,4 free,almost claw free graph on at least three vertices is vertices pancyclic. This paper shows that every connected,locally 2 connected K 1,4 free claw centre independent graph on at least three vertices is vertex pancyclic.展开更多
基金Supported in part by the National Natural Science Foundation of China(11631014)the National Key Research&Development Program of China(2017YFC0908405)。
文摘A matching is extendable in a graph G if G has a perfect matching containing it.A distance q matching is a matching such that the distance between any two distinct matching edges is at least q.In this paper,we prove that any distance 2k-3 matching is extendable in a connected and locally(k-1)-connected K1,k-free graph of even order.Furthermore,we also prove that any distance q matching M in an r-connected and locally(k-1)-connected K1,k-free graph of even order is extendable provided that|M|is bounded by a function on r,k and q.Our results improve some results in[J.Graph Theory 93(2020),5–20].
基金National Natural Science Foundation of China(No.10871089)
文摘In this article, we investigate the dynamical properties of fλ(z) =λzke2, for λ(≠0) ∈Cand k≥2. We will show that the boundaries of some (or all ) Fatou components are Jordan curves and the Julia sets are Sierpinski carpet, and they are locally connected for some certain λ.
基金Sponsored by the Foundation of Pre-973 Program of China under grant2006CB708304the National NSFC under grant 10771195the NSF of Zhejiang Province under grant Y607128
文摘Let D■R2 be a Jordan domain,D*=R2\D,the exterior of D.In this article,the authors obtained the following results:(1)If D is a John disk,then D is an outer linearly locally connected domain;(2)If D* is a John disk,then D is an inner linearly locally connected domain;(3)A homeomorphism f:R 2 →R 2 is a quasiconformal mapping if and only if f(D)is a John disk for any John disk D■R 2 ;and(4)If D is a bounded quasidisk,then D is a John disk,and there exists an unbounded quasidisk which is not a John disk.
基金Supported by the Teaching Research Project of Hubei Province(2013469)the 12th Five-Year Project of Education Plan of Hubei Province(2014B379)
文摘In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system(IFS). For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets are connected, if and only if all the N graphs are connected; in this case, the invariant sets are all locally connected and path connected. Our result extends the results on the connectedness of the self-similar sets.
基金Project supported by the National Natural Science Foundation of China(Nos.11272126,51435006,and 51421062)the Fundamental Research Funds for the Central Universities,HUST:2016JCTD114 and 2015TS121the Research Fund for the Doctoral Program of Higher Education of China(No.20110142120050)
文摘A circular thin plate is proposed for vibration attenuation,which is attached alternately by annular piezoelectric unimorphs with resonant shunt circuits.Two kinds of equal frequency resonant shunt circuits are designed to achieve an integrated locally resonant(LR)band gap(BG) with a much smaller transmission factor:(1) the structure is arrayed periodically while the resonant shunt circuits are aperiodic;(2) the resonant shunt circuits are periodic while the structure is aperiodic.The transmission factor curve is calculated,which is validated by the finite element method.Dependences of the LR BG performance upon the geometric and electric parameters are also analyzed.
基金Supported by the Science Foundation of Tsinghua University
文摘gives that every connected,locally connected K 1,4 free,almost claw free graph on at least three vertices is vertices pancyclic. This paper shows that every connected,locally 2 connected K 1,4 free claw centre independent graph on at least three vertices is vertex pancyclic.