For a connected graph, path containing all vertices is known as Hamiltonian path. general graphs, there no necessary and sufficient condition for the existence of paths complexity finding in graphs NP-Complete. We present 2-trees. Using our characterization, we also linear-time algorithm Our characterization based on deep understanding structure 2-trees combinatorics presented here may be used ...

CuBr(PPh3)2(4,6-dimethylpyrimidine-2-thione) (Cu-L) was synthesized by stirring CuBr(PPh3)3 and 4,6-dimethylpyrimidine-2-thione in dichloromethane. The crystal structure of Cu-L obtained, indicated that the complex adopts a distorted tetrahedral with several intramolecular hydrogen bonds. Moreover, centrosymmetric dimer is formed intermolecular bonding bromine acceptor created symmetry operatio...