نتایج جستجو برای: symmetry index s

تعداد نتایج: 1155683  

2003
Qaisar Shafi

We discuss five dimensional (5D) supersymmetric SO(10) compactified on the orbifold S/(Z2 × Z ′ 2) such that the SO(10) gauge symmetry is broken on the fixed point(s) to its maximal subgroup(s). The MSSM gauge symmetry is recovered by the usual Higgs mechanism, and inflation is associated with the Higgs mechanism, implemented through F-term scalar potentials on the two fixed points. The spontan...

2012

Symmetry simplifications are introduced in configuration interaction (CI) by reducing the number of symmetry-allowed space types if there is degeneracy in some of the molecular orbitals by constructing the unique space types. A new symmetry group which we call the configuration symmetry group is defined and is shown to be expressible as a generalized wreath product group. Generating functions a...

2004
K. BALASUBRAMANIAN

Symmetry simplifications are introduced in configuration interaction (CI) by reducing the number of symmetry-allowed space types if there is degeneracy in some of the molecular orbitals by constructing the unique space types. A new symmetry group which we call the configuration symmetry group is defined and is shown to be expressible as a generalized wreath product group. Generating functions a...

2017
Nouratan Singh

Introduction: A comparative study of blood cross match between gel card technique and conventional tube method wasundertaken on approx 1000 sample conducted in Sanjay Gandhi Memorial Hospital ,Rewa associated with Shyam shahmedical college Rewa .Material & Methods: most commonly conventional tube method are used widly. Now new technique of cross matching isintroduced . In th...

Journal: :Graphs and Combinatorics 2012
Lili Zhang Yehong Shao Guihai Chen Xinping Xu Ju Zhou

A graph G is vertex pancyclic if for each vertex v ∈ V (G), and for each integer k with 3 ≤ k ≤ |V (G)|, G has a k-cycle Ck such that v ∈ V (Ck). Let s ≥ 0 be an integer. If the removal of at most s vertices in G results in a vertex pancyclic graph, we say G is an s-vertex pancyclic graph. Let G be a simple connected graph that is not a path, cycle or K1,3. Let l(G) = max{m : G has a divalent p...

Journal: :Discrete Mathematics 2008
Lili Zhang Elaine M. Eschen Hong-Jian Lai Yehong Shao

For integers k, s with 0 ≤ k ≤ s ≤ |V (G)| − 3, a graph G is called s-Hamiltonian if the removal of any k vertices results in a Hamiltonian graph. For a simple connected graph that is not a path, a cycle or a K1,3 and an integer m ≥ 0, we define hs(G) = min{m : L(G) is s-Hamiltonian} and l(G) = max{m : G has an arc of length m that is not both of length 2 and in a K3}, where an arc in G is a pa...

Fatemeh elmi Maryam Mitra Elmi

The analysis of the 27Al and 35Cl quadrupole coupling parameters of aluminum methyl chloride dimers were carried out on the basis of the density functional theory (DFT). The available experimental values of quarupole coupling constants were compared with their calculated ones. In this investigation, the correlations were made between calculated 27Al and 35Cl nuclear quadrupole coupling constant...

Journal: :Celal Bayar Üniversitesi Fen Bilimleri Dergisi 2017

Journal: :Journal of Physics: Conference Series 2020

Journal: :Journal of High Energy Physics 2012

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید