نتایج جستجو برای: forbidding wrong
تعداد نتایج: 21657 فیلتر نتایج به سال:
In an effort to make passwords more resistant to guessing attacks, system administrators provide users with suggestions and/or requirements for the passwords they create. This guidance may include password-composition requirements, such as requiring the password to have a minimum length and include both letters and numbers. Other common strategies include using a meter to suggest or enforce com...
While consolidating democracy in Muslim-majority countries like many Arab today, the problem of opposition between people and rulers still leaves a latent conflict. The is not new Islamic world. In this context, Ḥanābilah oppositional movement against al-Ma'mūn's miḥna policy finds its significance here. article aimed to determine genealogy correct Weberian perspective reading socio-religious m...
Robertson and Seymour proved that the relation of graph immersion is wellquasi-ordered for finite graphs. Their proof uses the results of graph minors theory. Surprisingly, there is a very short proof of a corresponding rough structure theorem for graphs without Kt-immersions; it is based on the Gomory-Hu theorem. The same proof also works to establish a rough structure theorem for Eulerian dig...
Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a forbidden graph F , we define an F -WORM coloring of G as a coloring of the vertices if G without a rainbow or monochromatic subgraph isomorphic to F . We explore such colorings especially...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید