نتایج جستجو برای: Charactrization
تعداد نتایج: 24 فیلتر نتایج به سال:
Elias Dahlhaus Paul D. Manuel y Mirka Miller y Abstract In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the cycle.
In this paper, we study some properties of φ-prime submodules andwe give another charactrization for it. For given N and K a moduleM with ⊆ N, prove that is submodule if only N/Kis φ_K-prime submodule. Finally, show any finite sum isφ-prime.
A geometric charactrization of the equation found by Hietarinta and Viallet, which satisfies the singularity confinement criterion but which exhibits chaotic behavior, is presented. It is shown that this equation can be lifted to an automorphism of a certain rational surface and can therefore be considered to be a realization of a Cremona isometry on the Picard group of the surface. It is also ...
incorporation of copper species into silica matrix was performed by the sol-gel method. copper ions and copper particles were doped using two different copper sources; cu(no3)2.3h2o and copper particles chemically synthesized.the particles of copper metallic, cuprous and cupric oxide were prepared and the synthesis and characterizations of copper species were compared together. on the other han...
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their compliments. Then we split characterizing edge-minimal 2-self-centered graphs into two cases. First, we characterize edge-minimal 2-self-centered graphs without triangles by introducing intersecting bi-i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید