For a simple graph G,let matrix Q(G)=D(G) + A(G) be it’s signless Laplacian matrix and Q G (λ)=det(λI Q) it’s signless Laplacian characteristic polynomial,where D(G) denotes the diagonal matrix of vertex degrees of G,A(G) denotes its adjacency matrix of G.If all eigenvalues of Q G (λ) are integral,then the graph G is called Q-integral.In this paper,we obtain that the signless Laplacian characteristic polynomials of the complete multi-partite graphs G=K(n1,n2,···,nt).We prove that the complete t-partite graphs K(n,n,···,n)t are Q-integral and give a necessary and sufficient condition for the complete multipartite graphs K(m,···,m)s(n,···,n)t to be Q-integral.We also obtain that the signless Laplacian characteristic polynomials of the complete multipartite graphs K(m,···,m,)s1(n,···,n,)s2(l,···,l)s3. 相似文献
A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho’s result [B. Zhou, H.H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary
and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral
to a multicone graph. Additionally, lower and upper bounds for the largest eigenvalue of a multicone graph are given. 相似文献
A sparse representation-based two-phase classification algorithm is proposed for off-line handwritten Tibetan character recognition. The first phase realizes coarse classification with the K-NN classifier by finding the K nearest neighbours of a test sample in the dictionary constructed by K-SVD with samples of all classes, and the classes of these neighbours are regarded as the candidate classes of the test sample. The second phase performs fine classification with the sparse representation classifier by sparsely representing the test sample with all elements of the dictionary constructed by K-SVD with samples of all candidate classes, and the test sample is finally classified into the candidate class with the maximal contribution in sparse representation. Experiments on the Tibetan off-line handwritten character database show that an optimal recognition rate of 97.17% has been reached and it is 2.12% higher than that of K-NN. 相似文献
A new tripodal ligand, N,N′,N″-tri(salicylaldehyde)triaminotriethylamine (1) has been synthesized and characterized by elemental analysis, IR and UV spectroscopy, MS, and X-ray crystallography. X-ray diffraction analysis reveals that the three chains of the ligand form a cup-like structure. The ligand’s magnesium(II) complex has been synthesized and characterized by elemental analysis, conductivity, and IR and UV spectroscopy. The luminescence properties of the ligand and its magnesium(II) complex were investigated in DMF, CH3OH, and CH3CH2OH solution and in the solid state at room temperature. 相似文献
The sorption of UO22+ from aqueous solution on attapulgite was investigated as a function of contact time, solid content, pH, ionic strength, foreign ions, humic acid (HA), and fulvic acid (FA) under ambient conditions by using batch technique. The attapulgite sample was characterized by XRD and FTIR in detail. The results indicated that the sorption of UO22+ was strongly dependent on pH and ionic strength. The sorption of UO22+ on attapulgite increased quickly with rising pH at pH < 6.5, and decreased with increasing pH at pH > 6.5. The presence of HA or FA enhanced the sorption of UO22+ on attapulgite obviously at low pH because of the strong complexation of surface adsorbed HA/FA with UO22+ on attapulgite surface. Sorption of UO22+ on attapulgite was mainly dominated by ion-exchange or outer-sphere surface complexation at low pH values, but by inner-sphere surface complexation at high pH values. The results indicate that attapulgite is a very suitable adsorbent for the preconcentration and solidification of UO22+ from large volumes of aqueous solutions because of its negative surface charge and large surface areas. 相似文献
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less than or equal to a given constant is NP-complete (although this was conjectured to be polynomial). Consequently, the corresponding problem to determine the hamiltonian index of a given graph is NP-hard. Finally, we show that some known upper and lower bounds on the hamiltonian index can be computed in polynomial time. 相似文献
The authors report on a simple strategy for sensitive determination of the activity of terminal deoxynucleotidyl transferase (TdT) using copper nanoclusters (CuNCs) as fluorescent probes. TdT-polymerized long chain AT-rich DNA serves as a template for the synthesis of the CuNCs, and TdT activity is detected fluorometrically at excitation/emission wavelengths of 340/570 nm. The protocol relies on the target-triggered formation of dsDNA polymers and in-situ formation of CuNCs. The calibration plot is linear in the 0.7 to 14 U L?1 activity range, with a 60 mU L?1 detection limit (at a signal-to-noise ratio of 3). The protocol was applied to determine TdT activity in acute lymphatic leukemia cells. This approach is selective, simple, convenient and cost-efficient because a complex DNA sequence is not required. In our perception, the method provides a viable new platform for monitoring the activity and inhibition of TdT.
Graphical abstract Based on the target-triggered formation of dsDNA polymers and in-situ formation of CuNCs with strong fluorescence, a turn-on fluorescence assay for TdT activity is presented.