arXiv subjects

Xiao-Dong Zhang

Publications and source records attributed to Xiao-Dong Zhang.

At least 91 records · Page 5Linked to original sources

arXiv2016

Highly Catalytic Nanodots with Renal Clearance for Radiation Protection

Ionizing radiation (gamma and x-ray) is widely used in industry and medicine, but it can also pose a significant hazardous effect on health and induce cancer, physical deformity and even death, due to DNA damages and invasion of free radicals. There is therefore an urgent unmet demand in designing highly efficient radioprotectants with synergetic integration of effective renal clearance and low toxicity. In this study, we designed ultrasmall (sub-5 nm) highly catalytically active and cysteine-protected MoS2 dots as radioprotectants and investigated their application in protection against ionizing radiation. In vivo preclinical studies showed that the surviving fraction of MoS2-treated mice can appreciably increase to up to 79 % when they were exposed to high-energy ionizing radiation. Furthermore, MoS2 dots can contribute in cleaning up the accumulated free radicals within the body, repairing DNA damages and recovering all vital chemical and biochemical indicators, suggesting their unique role as free radical scavengers. MoS2 dots showed rapid and efficient urinary excretion with more than 80 % injected dose (I.D.) eliminated from the body after 24 hours due to their ultrasmall hydrodynamic size and did not cause any noticeable toxic responses up to 30 days.

physics.bio-ph↗

arXiv2016

Ordering connected graphs by their Kirchhoff indices

The Kirchhoff index $Kf(G)$ of a graph $G$ is the sum of resistance distances between all unordered pairs of vertices, which was introduced by Klein and Randić. In this paper we characterized all extremal graphs with Kirchhoff index among all graphs obtained by deleting $p$ edges from a complete graph $K_n$ with $p\leq\lfloor\frac{n}{2}\rfloor$ and obtained a sharp upper bound on the Kirchhoff index of these graphs. In addition, all the graphs with the first to ninth maximal Kirchhoff indices are completely determined among all connected graphs of order $n>27$.

math.CO↗

arXiv2015

Laplacian Coefficient, Matching Polynomial and Incidence Energy of of Trees with Described Maximum Degree

Let $\mathcal{L}(T,λ)=\sum_{k=0}^n(-1)^{k}c_{k}(T)λ^{n-k}$ be the characteristic polynomial of its Laplacian matrix of a tree $T$. This paper studied some properties of the generating function of the coefficients sequence $(c_0, \cdots, c_n)$ which are related with the matching polynomials of division tree of $T$. These results, in turn, are used to characterize all extremal trees having the minimum Laplacian coefficient generation function and the minimum incidence energy of trees with described maximum degree, respectively.

math.CO↗

arXiv2015

The Turan Number of Disjoint Copies of Paths

The Turán number of a graph $H$, $ex(n,H)$, is the maximum number of edges in a simple graph of order $n$ which does not contain $H$ as a subgraph. Let $k\cdot P_3$ denote $k$ disjoint copies of a path on $3$ vertices. In this paper, we determine the value $ex(n, k\cdot P_3)$ and characterize all extremal graphs. This extends a result of Bushaw and Kettle [N. Bushaw and N. Kettle, Turán Numbers of multiple and equibipartite forests, Combin. Probab. Comput., 20(2011) 837-853.], which solved the conjecture proposed by Gorgol in [I. Gorgol. Turán numbers for disjoint copies of graphs. {\it Graphs Combin.}, 27 (2011) 661-667.].

math.CO↗

arXiv2015

The Terminal Wiener Index of Trees with Diameter or Maximum Degree

The terminal Wiener index of a tree is the sum of distances for all pairs of pendent vertices, which recently arises in the study of phylogenetic tree reconstruction and the neighborhood of trees. This paper presents a sharp upper and lower bounds for the terminal Wiener index in terms of its order and diameter and characterizes all extremal trees which attain these bounds. In addition, we investigate the properties of extremal trees which attain the maximum terminal Wiener index among all trees of order $n$ with fixed maximum degree.

math.CO↗

arXiv2015

Extremal Graph Theory for Degree Sequences

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs having the maximum (or minimum) values of graph invariants such as (Laplacian, p-Laplacian, signless Laplacian) spectral radius, the first Dirichlet eigenvalue, the Wiener index, the Harary index, the number of subtrees and the chromatic number etc, in given sets with the same tree, unicyclic, graphic degree sequences. Moreover, some conjectures are included.

math.CO↗

arXiv2015

On the spectral radius of simple digraphs with prescribed number of arcs

This paper presents a sharp upper bound for the spectral radius of simple digraphs with described number of arcs. Further, the extremal graphs which attain the maximum spectral radius among all simple digraphs with fixed arcs are investigated. In particular, we characterize all extremal simple digraphs with the maximum spectral radius among all simple digraphs with arcs number $e=2{k\choose 2}+t$ and $k>4t^4+4$.

math.CO↗

arXiv2015

The Second Zagreb Indices of Graphs with Given Degree Sequences

The second Zagreb index of a graph G is denoted by $M_2(G)=\sum_{uv\in E(G)}d(u)d(v)$. In this paper, we investigate properties of the extremal graphs with the maximum second Zagreb indices with given graphic sequences, in particular graphic bicyclic sequences. Moreover, we obtain the relations of the second Zagreb indices among the extremal graphs with different degree sequences.

math.CO↗

arXiv2015

Ultrasmall Glutathione-Protected Gold Nanoclusters as Next Generation Radiotherapy Sensitizers with High Tumor Uptake and High Renal Clearance

Radiotherapy is often the most straightforward first line cancer treatment for solid tumors. While it is highly effective against tumors, there is also collateral damage to healthy proximal tissues especially with high doses. The use of radiosensitizers is an effective way to boost the killing efficacy of radiotherapy against the tumor while drastically limiting the received dose and reducing the possible damage to normal tissues. Here, we report the design and application of a good radiosensitizer by using ultrasmall gold nanoclusters with a naturally occurring peptide (e.g., glutathione or GSH) as the protecting shell. The GSH coated gold nanoclusters can escape the RES absorption, leading to a good tumor uptake (8.1% ID/g at 24 h post injection). As a result, the as-designed Au nanoclusters led to a strong enhancement for radiotherapy, as well as a negligible damage to normal tissues. After the treatment, the ultrasmall gold nanoclusters can be efficiently cleared by the kidney, thereby avoiding potential long term side effects caused by the accumulation of gold atoms in the body. Our data suggest that the ultrasmall peptide protected Au nanoclusters are a promising radiosensitizer for cancer radiotherapy.

physics.med-ph↗

arXiv2014

Storage of Gold Nanoclusters in Muscle Leads to their Biphasic in Vivo Clearance

Ultrasmall gold nanoclusters show great potential in biomedical applications. Long term biodistribution, retention, toxicity, and pharmacokinetics profiles are prerequisites in their potential clinical applications. Here we systematically investigated the biodistribution, clearance, and toxicity of one widely used Au NC species glutathione protected Au NCs or GSH Au NCs, over a relatively long period of 90 days in mice. We observed that most of the Au NCs were cleared at 30 days post injection with a major accumulation in liver and kidney. However, it is surprising that an abnormal increase of Au amount in the heart, liver, spleen, lung, and testis was observed at 60 and 90 days, indicating that the injected Au NCs formed a V shaped time dependent distribution profile in various organs. Further investigations revealed that Au NCs were steadily accumulating in the muscle in the first 30 days p.i., and the as stored Au NCs gradually released into blood in 30 to 90 days, which induced a redistribution and reaccumulation of Au NCs in all blood rich organs. Further hematology and biochemistry studies showed that the reaccumulation of Au NCs still caused some liver toxicity at 30 days p.i. The muscle storage and subsequent release may give rise to the potential accumulation and toxicity risk of functional nanomaterials over long periods of time.

physics.bio-ph↗

arXiv2014

The Laplacian Eigenvalues and Invariants of Graphs

In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence of Hamiltonicity in a graph involving its Laplacian eigenvalues.

math.CO↗

arXiv2014

The Roots and Links in a Class of $M$-Matrices

In this paper, we discuss exiting roots of sub-kernel transient matrices $P$ associated with a class of $M-$ matrices which are related to generalized ultrametric matrices. Then the results are used to describe completely all links of the class of matrices in terms of structure of the supporting tree.

math.CO↗

arXiv2014

Ultrasmall Au10-12(SG)10-12 Nanomolecules for High Tumor Specificity and Cancer Radiotherapy

Radiosensitizers can increase the local treatment efficacy under a relatively low and safe radiation dose, thereby facilitating tumor eradication and minimizing side effects. Here, we report a new class of radiosensitizers that contain several gold (Au) atoms embedded inside a peptide shell (e.g., Au10-12(SG)10-12) and can achieve ultrahigh tumor uptake (10.86 SUV at 24 h post injection) and targeting specificity, efficient renal clearance, and high radiotherapy enhancement.

physics.bio-ph↗

arXiv2014

On the Erdos-Sos Conjecture for Graphs on n=k+4 Vertices

The Erdős-Sós Conjecture states that if $G$ is a simple graph of order $n$ with average degree more than $k-2,$ then $G$ contains every tree of order $k$. In this paper, we prove that Erdős-Sós Conjecture is true for $n=k+4$.

math.CO↗

arXiv2013

Metabolizable Bi2Se3 Nanoplates: Biodistribution, Toxicity, and Uses for Cancer Radiation Therapy and Imaging

Bi, a high atom number element, has a high photoelectric absorption coefficient, and Se element has anticancer activity. Hence, their compound chalcogenide (Bi2Se3) deserves a thorough investigation for biomedical applications. This study reveals that Bi2Se3 nanoplates (54 nm wide) protected with poly(vinylpyrollidone) (PVP) are biocompatible and have low toxicity even at a high dose of 20 mg/kg in mice. This conclusion was made through the studies on the biodistribution and 90-day long term in vivo clearance of the nanoplates. Liver and spleen were dominant organs for the nanoplates accumulation which was mainly due to RES absorption, but 93 % the nanoplates were cleared after 90 days treatment. Concentrations of Bi and Se in tumor tissue continuously increased until 72 h after intraperitoneal injection into mice. Such selective accumulation of Bi was utilized to enhance the contrast of X-ray CT images. The Bi elements concentrated in a tumor led to damage on the tumor cells when exposed to gamma radiation. Growth of the tumor significantly delayed and stopped after 16 days after the tumor was treated with the Bi2Se3 nanoplates and radiation. This work clearly shows that the Bi2Se3 nanoplates may be used for cancer radiation therapy and CT imaging. They deserve further studies for biological and medical applications.

physics.bio-ph↗

arXiv2013

Laplacian coefficients of unicyclic graphs with the number of leaves and girth

Let $G$ be a graph of order $n$ and let $\mathcal{L}(G,λ)=\sum_{k=0}^n (-1)^{k}c_{k}(G)λ^{n-k}$ be the characteristic polynomial of its Laplacian matrix. Motivated by Ilić and Ilić's conjecture [A. Ilić, M. Ilić, Laplacian coefficients of trees with given number of leaves or vertices of degree two, Linear Algebra and its Applications 431(2009)2195-2202.] on all extremal graphs which minimize all the Laplacian coefficients in the set $\mathcal{U}_{n,l}$ of all $n$-vertex unicyclic graphs with the number of leaves $l$, we investigate properties of the minimal elements in the partial set $(\mathcal{U}_{n,l}^g, \preceq)$ of the Laplacian coefficients, where $\mathcal{U}_{n,l}^g$ denote the set of $n$-vertex unicyclic graphs with the number of leaves $l$ and girth $g$. These results are used to disprove their conjecture. Moreover, the graphs with minimum Laplacian-like energy in $\mathcal{U}_{n,l}^g$ are also studied.

math.CO↗

arXiv2013

Enhanced Tumor Accumulation of Sub-2 nm Gold Nanoclusters for Cancer Radiation Therapy

A new type of metabolizable and efficient radiosensitizer for cancer radiotherapy is presented in this study by combining ultrasmall Au nanoclusters (NCs, <2 nm) with biocompatible coating ligands (glutathione, GSH). The new nano-construct (GSH-coated Au25 NCs) inherits attractive features of both the Au core (strong radiosensitizing effect) and GSH shell (good biocompatibility). It can preferentially accumulate in tumor via the improved EPR effect, which leads to strong enhancement for cancer radiotherapy. After the treatment, the small-sized GSH-Au25 NCs can be efficiently cleared by the kidney, minimizing any potential side effects due to the accumulation of Au25 NCs in the body.

physics.bio-ph↗

arXiv2013

The Minimum Spectral Radius of Graphs with the Independence Number

In this paper, we investigate some properties of the Perron vector of connected graphs. These results are used to characterize that all extremal connected graphs with having the minimum (maximum) spectra radius among all connected graphs of order $n=kα$ with the independence number $α$, respectively.

math.CO↗