排序方式: 共有65条查询结果,搜索用时 15 毫秒
1.
2.
In this paper, we study the algebraic connectivity of a Hamiltonian graph, and determine all Hamiltonian graphs whose algebraic connectivity attain the minimum among all Hamiltonian graphs on n vertices. 相似文献
3.
To identify the detailed roles of water bridges in neonicotinoids recognition, twenty-four neonicotinoids compounds were designed, synthesized, bioassayed and modelled. Of all nine fragments mimicking water bridges, cyano group was the optimal one. The insecticidal activities indicated that the water bridge might be stable in the active site and was not suitable to be replaced by other groups, which highlighted the significance of water bridges for neonicotinoids. 相似文献
4.
5.
Guanglong Chen Cheng Wang Haiyang Lu Jiansheng Liu Ruxin Li Guoquan Ni Zhizhan Xu 《中国光学快报(英文版)》2008,6(6)
We use an electrostatic model to study the average kinetic energy of ions ejected from the pure Coulomb explosions of methane clusters (CA4)n (light atom A=H and D). It is found that the ratio of the average kinetic energy of the ions to their initial average electrostatic potential energy is irrelevant to the cluster size. This finding implies that as long as the ratio is given, the average kinetic energies of the ions can be simply estimated from their initial average electrostatic potential energies, rather than from the time- consuming simulations. The ratios for the different charge states of carbon ions are presented. 相似文献
6.
7.
A copper‐catalyzed tandem intramolecular cyclization‐addition reaction of N‐(o‐alkynylphenyl)imines is disclosed. This strategy offers a simple and promising method for accessing ring‐fused indoles. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
8.
一种摩擦学状态在线监测系统的研究 总被引:2,自引:5,他引:2
研制了一种用于船用柴油机的摩擦学状态在线监测系统。它集磨粒监测,润滑油质量监测,柴油机扭矩及时转速监测于一体,利用在线铁谱技术监测润滑油中的铁磁性磨粒,利用容栅型电容传感器在线监测污染物引起的润滑油介电常数的变化,利用光电传感器和随轴转动齿盘产生的脉冲及相位差在线测量柴油机输出轴的扭矩及瞬时转速。此外,该监测系统还可将柴油机的磨损状态与动力状态相关联,监测由于各缸爆排压力变化造成的瞬时转速变化,从 相似文献
9.
Let D(G)=(di,j)n×n denote the distance matrix of a connected graph G with order n, where dij is equal to the distance between vi and vj in G. The largest eigenvalue of D(G) is called the distance spectral radius of graph G, denoted by ?(G). In this paper, we give some graft transformations that decrease and increase ?(G) and prove that the graph (obtained from the star Sn on n (n is not equal to 4, 5) vertices by adding an edge connecting two pendent vertices) has minimal distance spectral radius among unicyclic graphs on n vertices; while (obtained from a triangle K3 by attaching pendent path Pn−3 to one of its vertices) has maximal distance spectral radius among unicyclic graphs on n vertices. 相似文献
10.