Eight different Dichloro(bis{2-[1-(4-R-phenyl)-1H-1,2,3-triazol-4-yl-κN3]pyridine-κN})iron(II) compounds, 2–9, have been synthesised and characterised, where group R=CH3 (L2), OCH3 (L3), COOH (L4), F (L5), Cl (L6), CN (L7), H (L8) and CF3 (L9). The single crystal X-ray structure was determined for the L3 which was complemented with Density Functional Theory calculations for all complexes. The structure exhibits a distorted octahedral geometry, with the two triazole ligands coordinated to the iron centre positioned in the equatorial plane and the two chloro atoms in the axial positions. The values of the FeII/III redox couple, observed at ca. −0.3 V versus Fc/ Fc+ for complexes 2–9, varied over a very small potential range of 0.05 V.

   In this work , we applied the nuclear shell model by using Modified Surface Delta Interaction ( MSDI ) to study the nuclear structure for Ti42-44 nuclei from the calculation of the energy level values and its total angular momentum .      After comperation with the experiment values which found to be rather in good agreement and determined the total angular momentum values of energy levels which are not assigned experimently , as soon as , we certify some values that were not certained experimently .  

Multipole mixing ratios for gamma transition populated in from reaction have been studied by least square fitting method also transition strength ] for pure gamma transitions have been calculated taking into account the mean life time for these levels .

Let G be a graph with p vertices and q edges and  be an injective function, where k is a positive integer. If the induced edge labeling   defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G. A graph which admits an odd Fibonacci edge irregular labeling is called an odd Fibonacci edge irregular graph. The odd Fibonacci edge irregularity strength ofes(G) is the minimum k for which G admits an odd Fibonacci edge irregular labeling. In this paper, the odd Fibonacci edge irregularity strength for some subdivision graphs and graphs obtained from vertex identification is determined.