The domination number and the least QQ-eigenvalue

A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all dominating sets of $G$. For a graph, the least $Q$-eigenvalue is the least eigenvalue of its signless Laplacian matrix. In this paper, for a nonbipartite graph with both order $n$ and domination number $\gamma$, we show that $n\geq 3\gamma-1$, and show that it contains a unicyclic spanning subgraph with the same domination number $\gamma$. By investigating the relation between the domination number and the least $Q$-eigenvalue of a graph, we minimize the least $Q$-eigenvalue among all the nonbipartite graphs with given domination number.Comment: 13 pages, 3 figure

Analysis of the strong vertices of ΣcND∗\Sigma_cND^{*} and ΣbNB∗\Sigma_bNB^{*} in QCD sum rules

The strong coupling constant is an important parameter which can help us to understand the strong decay behaviors of baryons. In our previous work, we have analyzed strong vertices $\Sigma_{c}^{*}ND$, $\Sigma_{b}^{*}NB$, $\Sigma_{c}ND$, $\Sigma_{b}NB$ in QCD sum rules. Following these work, we further analyze the strong vertices $\Sigma_{c}ND^{*}$ and $\Sigma_{b}NB^{*}$ using the three-point QCD sum rules under Dirac structures $q\!\!\!/p\!\!\!/\gamma_{\alpha}$ and $q\!\!\!/p\!\!\!/p_{\alpha}$. In this work, we first calculate strong form factors considering contributions of the perturbative part and the condensate terms $\langle\overline{q}q\rangle$, $\langle\frac{\alpha_{s}}{\pi}GG\rangle$ and $\langle\overline{q}g_{s}\sigma Gq\rangle$. Then, these form factors are used to fit into analytical functions. According to these functions, we finally determine the values of the strong coupling constants for these two vertices $\Sigma_{c}ND^{*}$ and $\Sigma_{b}NB^{*}$.Comment: arXiv admin note: text overlap with arXiv:1705.0322

A New Method for Fast Computation of Moments Based on 8-neighbor Chain CodeApplied to 2-D Objects Recognition

2D moment invariants have been successfully applied in pattern recognition tasks. The main difficulty of using moment invariants is the computational burden. To improve the algorithm of moments computation through an iterative method, an approach for fast computation of moments based on the 8-neighbor chain code is proposed in this paper. Then artificial neural networks are applied for 2D shape recognition with moment invariants. Compared with the method of polygonal approximation, this approach shows higher accuracy in shape representation and faster recognition speed in experiment

Hierarchical structured graphene/metal oxide/porous carbon composites as anode materials for lithium-ion batteries

This work was financially supported by the Fundamental Research Funds for the Central Universities, and National Natural Science Foundation of China (21101014 and 21273022).As a novel anode material for lithium-ion batteries, CeO2 displays imperceptible volumetric and morphological changes during the lithium insertion and extraction processes, and thereby exhibits good cycling stability. However, the low theoretical capacity and poor electronic conductivity of CeO2 hinder its practical application. In contrast, Co3O4 possesses high theoretical capacity, but undergoes huge volume change during cycling. To overcome these issues, CeO2 and Co3O4 nanoparticles are formed inside the pores of CMK-3 and display various electrochemical behaviors due to the different morphological structures of CeO2 and Co3O4 within CMK-3. Moreover, the graphene/metal oxide/CMK-3 composites with a hierarchical structure are then prepared and exhibit better electrochemical performances than metal oxides with or without CMK-3. This novel synthesis strategy is hopefully employed in the electrode materials design for Li-ion batteries or other energy conversion and storage devices.PostprintPeer reviewe