A cycle C of a graph G is a m-distance-dominating cycle if for all vertices of . Defining denotes the minimum value of the degree sum of any k independent vertices of G. In this paper, we prove that if G is a 3-connec...A cycle C of a graph G is a m-distance-dominating cycle if for all vertices of . Defining denotes the minimum value of the degree sum of any k independent vertices of G. In this paper, we prove that if G is a 3-connected graph on n vertices, and if , then every longest cycle is m-distance-dominating cycles.展开更多
Let σk（G） denote the minimum degree sum of k independent vertices in G and α（G） denote the number of the vertices of a maximum independent set of G. In this paper we prove that if G is a 4-connected graph of ord...Let σk（G） denote the minimum degree sum of k independent vertices in G and α（G） denote the number of the vertices of a maximum independent set of G. In this paper we prove that if G is a 4-connected graph of order n and σ5（G） 〉 n ＋ 3σ（G） ＋ 11, then G is Hamiltonian.展开更多
For a vertex set{u<sub>1</sub>,u<sub>2</sub>,…,u<sub>k</sub>}of a graph G with n vertices,let s（G;{u<sub>1</sub>,u<sub>2</sub>,…,u<sub>k</sub>...For a vertex set{u<sub>1</sub>,u<sub>2</sub>,…,u<sub>k</sub>}of a graph G with n vertices,let s（G;{u<sub>1</sub>,u<sub>2</sub>,…,u<sub>k</sub>}）=Σ<sub>1</sub>≤i≤j≤k<sup>|N（u<sub>i</sub>）UN（u<sub>j</sub>）|</sup>, NC<sub>k</sub>.=min{s（G;{x<sub>1</sub>,…,x<sub>k</sub>}）:{x<sub>1</sub>,…,x<sub>k</sub>}is an independent set}. In this paper,we shall prove that if G is 3-connected and NC<sub>4</sub>≥3n,then G is either a hamiltonian or Petersen graph.This generalizes some results on the neighborhood union conditions for hamiltonian graphs.展开更多
A tree with at most m leaves is called an m-ended tree.Kyaw proved that every connected K1,4-free graph withσ4(G)n-1 contains a spanning 3-ended tree.In this paper we obtain a result for k-connected K1,4-free graphs ...A tree with at most m leaves is called an m-ended tree.Kyaw proved that every connected K1,4-free graph withσ4(G)n-1 contains a spanning 3-ended tree.In this paper we obtain a result for k-connected K1,4-free graphs with k 2.Let G be a k-connected K1,4-free graph of order n with k 2.Ifσk+3(G)n+2k-2,then G contains a spanning 3-ended tree.展开更多
Venous access devices are of pivotal importance for an increasing number of critically ill patients in a variety of disease states and in a variety of clinical settings(emergency, intensive care, surgery) and for diff...Venous access devices are of pivotal importance for an increasing number of critically ill patients in a variety of disease states and in a variety of clinical settings(emergency, intensive care, surgery) and for different purposes(fluids or drugs infusions, parenteral nutrition, antibiotic therapy, hemodynamic monitoring, procedures of dialysis/apheresis). However, healthcare professionals are commonly worried about the possible consequences that may result using a central venous access device(CVAD)(mainly, bloodstream infections and thrombosis), both peripherally inserted central catheters(PICCs) and centrally inserted central catheters(CICCs). This review aims to discuss indications, insertion techniques, and care of PICCs in critically ill patients. PICCs have many advantages over standard CICCs. First of all, their insertion is easy and safe-due to their placement into peripheral veins of the armand the advantage of a central location of catheter tip suitable for all osmolarity and p H solutions. Using the ultrasound-guidance for the PICC insertion, the risk of hemothorax and pneumothorax can be avoided, as wellas the possibility of primary malposition is very low. PICC placement is also appropriate to avoid post-procedural hemorrhage in patients with an abnormal coagulative state who need a CVAD. Some limits previously ascribed to PICCs(i.e., low flow rates, difficult central venous pressure monitoring, lack of safety for radio-diagnostic procedures, single-lumen) have delayed their start up in the intensive care units as common practice. Though, the recent development of power-injectable PICCs overcomes these technical limitations and PICCs have started to spread in critical care settings. Two important take-home messages may be drawn from this review. First, the incidence of complications varies depending on venous accesses and healthcare professionals should be aware of the different clinical performance as well as of the different risks associated with each type of CVAD(CICCs or PICCs). Second, an inapp展开更多
The paper investigates the ability to retrieve the true soil moisture profile by assimilating near-surface soil moisture into a soil moisture model with an ensemble Kalman filter （EnKF） assimilation scheme, includin...The paper investigates the ability to retrieve the true soil moisture profile by assimilating near-surface soil moisture into a soil moisture model with an ensemble Kalman filter （EnKF） assimilation scheme, including the effect of ensemble size, update interval and nonlinearities in the profile retrieval, the required time for full retrieval of the soil moisture profiles, and the possible influence of the depth of the soil moisture observation. These questions are addressed by a desktop study using synthetic data. The ＂true＂ soil moisture profiles are generated from the soil moisture model under the boundary condition of 0.5 cm d^-1 evaporation. To test the assimilation schemes, the model is initialized with a poor initial guess of the soil moisture profile, and different ensemble sizes are tested showing that an ensemble of 40 members is enough to represent the covariance of the model forecasts. Also compared are the results with those from the direct insertion assimilation scheme, showing that the EnKF is superior to the direct insertion assimilation scheme, for hourly observations, with retrieval of the soil moisture profile being achieved in 16 h as compared to 12 days or more. For daily observations, the true soil moisture profile is achieved in about 15 days with the EnKF, but it is impossible to approximate the true moisture within 18 days by using direct insertion. It is also found that observation depth does not have a significant effect on profile retrieval time for the EnKF. The nonlinearities have some negative influence on the optimal estimates of soil moisture profile but not very seriously.展开更多
文摘A cycle C of a graph G is a m-distance-dominating cycle if for all vertices of . Defining denotes the minimum value of the degree sum of any k independent vertices of G. In this paper, we prove that if G is a 3-connected graph on n vertices, and if , then every longest cycle is m-distance-dominating cycles.
基金Supported by NNSF of China (Grant No. 60373012)supported by NSFC (Grant No. 10601044)XJEDU2006S05
文摘Let σk（G） denote the minimum degree sum of k independent vertices in G and α（G） denote the number of the vertices of a maximum independent set of G. In this paper we prove that if G is a 4-connected graph of order n and σ5（G） 〉 n ＋ 3σ（G） ＋ 11, then G is Hamiltonian.
基金Supported by the National Natural Science Foundation of ChinaSupported also by the Post-doctoral Foundation of China
文摘For a vertex set{u<sub>1</sub>,u<sub>2</sub>,…,u<sub>k</sub>}of a graph G with n vertices,let s（G;{u<sub>1</sub>,u<sub>2</sub>,…,u<sub>k</sub>}）=Σ<sub>1</sub>≤i≤j≤k<sup>|N（u<sub>i</sub>）UN（u<sub>j</sub>）|</sup>, NC<sub>k</sub>.=min{s（G;{x<sub>1</sub>,…,x<sub>k</sub>}）:{x<sub>1</sub>,…,x<sub>k</sub>}is an independent set}. In this paper,we shall prove that if G is 3-connected and NC<sub>4</sub>≥3n,then G is either a hamiltonian or Petersen graph.This generalizes some results on the neighborhood union conditions for hamiltonian graphs.
基金supported by Scientific Research Fund of Hubei Provincial Education Department (Grant No. Q20141609)National Natural Science Foundation of China (Grant Nos. 11371162 and 11271149)Wuhan Textile University (2012)
文摘A tree with at most m leaves is called an m-ended tree.Kyaw proved that every connected K1,4-free graph withσ4(G)n-1 contains a spanning 3-ended tree.In this paper we obtain a result for k-connected K1,4-free graphs with k 2.Let G be a k-connected K1,4-free graph of order n with k 2.Ifσk+3(G)n+2k-2,then G contains a spanning 3-ended tree.
文摘Venous access devices are of pivotal importance for an increasing number of critically ill patients in a variety of disease states and in a variety of clinical settings(emergency, intensive care, surgery) and for different purposes(fluids or drugs infusions, parenteral nutrition, antibiotic therapy, hemodynamic monitoring, procedures of dialysis/apheresis). However, healthcare professionals are commonly worried about the possible consequences that may result using a central venous access device(CVAD)(mainly, bloodstream infections and thrombosis), both peripherally inserted central catheters(PICCs) and centrally inserted central catheters(CICCs). This review aims to discuss indications, insertion techniques, and care of PICCs in critically ill patients. PICCs have many advantages over standard CICCs. First of all, their insertion is easy and safe-due to their placement into peripheral veins of the armand the advantage of a central location of catheter tip suitable for all osmolarity and p H solutions. Using the ultrasound-guidance for the PICC insertion, the risk of hemothorax and pneumothorax can be avoided, as wellas the possibility of primary malposition is very low. PICC placement is also appropriate to avoid post-procedural hemorrhage in patients with an abnormal coagulative state who need a CVAD. Some limits previously ascribed to PICCs(i.e., low flow rates, difficult central venous pressure monitoring, lack of safety for radio-diagnostic procedures, single-lumen) have delayed their start up in the intensive care units as common practice. Though, the recent development of power-injectable PICCs overcomes these technical limitations and PICCs have started to spread in critical care settings. Two important take-home messages may be drawn from this review. First, the incidence of complications varies depending on venous accesses and healthcare professionals should be aware of the different clinical performance as well as of the different risks associated with each type of CVAD(CICCs or PICCs). Second, an inapp
基金the National Natural Science Foundation of China(Grant Nos.40475012,90202014, 2001CB309404).
文摘The paper investigates the ability to retrieve the true soil moisture profile by assimilating near-surface soil moisture into a soil moisture model with an ensemble Kalman filter （EnKF） assimilation scheme, including the effect of ensemble size, update interval and nonlinearities in the profile retrieval, the required time for full retrieval of the soil moisture profiles, and the possible influence of the depth of the soil moisture observation. These questions are addressed by a desktop study using synthetic data. The ＂true＂ soil moisture profiles are generated from the soil moisture model under the boundary condition of 0.5 cm d^-1 evaporation. To test the assimilation schemes, the model is initialized with a poor initial guess of the soil moisture profile, and different ensemble sizes are tested showing that an ensemble of 40 members is enough to represent the covariance of the model forecasts. Also compared are the results with those from the direct insertion assimilation scheme, showing that the EnKF is superior to the direct insertion assimilation scheme, for hourly observations, with retrieval of the soil moisture profile being achieved in 16 h as compared to 12 days or more. For daily observations, the true soil moisture profile is achieved in about 15 days with the EnKF, but it is impossible to approximate the true moisture within 18 days by using direct insertion. It is also found that observation depth does not have a significant effect on profile retrieval time for the EnKF. The nonlinearities have some negative influence on the optimal estimates of soil moisture profile but not very seriously.
