Learn More
A linear forest in a graph is a subgraph each component of which is a path. In this paper, we investigate the existence of a Hamiltonian cycle passing through a linear forest in a ternary n-cube Q 3 n (n ≥ 2) with faulty edges. Let F be a faulty edge set of Q 3 n and L be a prescribed linear forest in Q 3 n − F . If |E(L)| ≤ 2n − 1 and |F | ≤ n −(More)
Objective. To identify the efficiency and safety of transcatheter arterial chemoembolization (TACE) combined with percutaneous ethanol (PEI) for patients with hepatocellular carcinoma (HCC) more than 3 cm in diameter in comparison with those of transcatheter arterial chemoembolization monotherapy. Methods. All databases were searched up to February 22,(More)
Current microbubble-based ultrasound contrast agents are administered intravenously resulting in large losses of contrast agent, systemic distribution, and strict requirements for microbubble longevity and diameter size. Instead we propose in situ production of microbubbles directly within the vasculature to avoid these limitations. Flow focusing(More)
k-Restricted edge connectivity is an important parameter in measuring the reliability and fault tolerance of large interconnection networks. In this paper we present two families of graphs similar with the networks proposed by Chen et al. Super-connectivity and super edge-connectivity for some interconnec-tion networks, Applied Mathematics and Computation(More)
The graph-theoretic parameter that has probably received the most attention over the years is the chromatic number. As is well-known, the coloring problem is an NP-Complete problem. In this paper, it has been solved by means of molecular biology techniques. The algorithm is highly parallel and has satisfactory fidelity. This work shows further evidence for(More)