氯二(氯甲基)胂 | 56863-50-4

• 分子结构分类: 有机化合物 - 有机金属化合物 - 有机类金属化合物
• 中文名称: 氯二(氯甲基)胂
• 英文名称: chloro-bis-chloromethyl-arsine
• 英文别名: Chlor-bis-chlormethyl-arsin；Arsine, chlorobis(chloromethyl)-；chloro-bis(chloromethyl)arsane
• CAS: 56863-50-4
• 化学式: C₂H₄AsCl₃
• 分子量: 209.334
• InChiKey: XVZVJZMPYVTERO-UHFFFAOYSA-N

计算性质

• 辛醇/水分配系数(LogP)：
  1.77
• 重原子数：
  6
• 可旋转键数：
  2
• 环数：
  0.0
• sp3杂化的碳原子比例：
  1.0
• 拓扑面积：
  0
• 氢给体数：
  0
• 氢受体数：
  0

反应信息

• 作为反应物：
  描述：

  氯二(氯甲基)胂 在 双氧水 作用下， 生成 bis-chloromethyl-arsinic acid
  参考文献：
  名称：

  The cardinality-constrained shortest path problem in 2-graphs

  摘要：

  We study the cardinality-constrained shortest path problem in acyclic graphs and, in particular, in the class of 2-graphs where we show that the problem may be solved by linear programming. A combinatorial algorithm is introduced based on some adjacency results for associated polytopes. An application in curve approximation is discussed and computational results are given where the mentioned algorithms are compared to Lagrangian relaxation and dynamic programming algorithms. (C) 2000 John Wiley & Sons, Inc.

  DOI：

  10.1002/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-b
• 作为产物：
  描述：

  重氮甲烷 在 乙醚 、 三氯化砷 作用下， 生成 (chloromethyl)dichloroarsane 、 氯二(氯甲基)胂
  参考文献：
  名称：

  The cardinality-constrained shortest path problem in 2-graphs

  摘要：

  We study the cardinality-constrained shortest path problem in acyclic graphs and, in particular, in the class of 2-graphs where we show that the problem may be solved by linear programming. A combinatorial algorithm is introduced based on some adjacency results for associated polytopes. An application in curve approximation is discussed and computational results are given where the mentioned algorithms are compared to Lagrangian relaxation and dynamic programming algorithms. (C) 2000 John Wiley & Sons, Inc.

  DOI：

  10.1002/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-b