نتایج جستجو برای: 1 gravitys rainbow 2 paranoia 3 anti

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

Journal: :journal of teaching language skills 2012
farideh pourgiv pavin ghasemi mahsa hashemi

gravity's rainbow is among the “most widely celebrated, unread novels” of american literature and already “a piece of minor folklore.” pynchon's genius manifests itself in his uniquely wide range of subject matter and literary techniques of presentation, narration, and interpretation. gravity's rainbow is a novel based on various sets of parallels, oppositions and double structures. these paral...

Journal: :Graphs and Combinatorics 2021

We consider a proper coloring of plane graph such that no face is rainbow, where rainbow if any two vertices on its boundary have distinct colors. Such said to be anti-rainbow. A quadrangulation G in which all faces are bounded by cycle length 4. In this paper, we show the number colors anti-rainbow does not exceed $$3\alpha (G)/2$$ , $$\alpha (G)$$ independence G. Moreover, minimum degree 3 or...

Journal: :Journal of Experimental Social Psychology 2021

The heightened belief that others intend to harm you (paranoia) is often accompanied by social withdrawal, avoidance and isolation. We investigated whether paranoia related betrayal aversion: the tendency avoid potential caused other people over above an equivalent a non-social mechanism. Across three large-N (Ntotal = 2433) pre-registered online studies, we employed game theoretic paradigm whe...

Journal: :Discussiones Mathematicae Graph Theory 2015

Journal: :Graphs and Combinatorics 2015
Ingo Schiermeyer Roman Soták

For a given graph H and n ≥ 1, let f(n,H) denote the maximum number m for which it is possible to colour the edges of the complete graph Kn with m colours in such a way that each subgraph H in Kn has at least two edges of the same colour. Equivalently, any edge-colouring of Kn with at least rb(n,H) = f(n,H) + 1 colours contains a rainbow copy of H. The numbers f(n,H) and rb(Kn, H) are called an...

Journal: :iranian journal of pharmacology and therapeutics 0
g.l. viswanatha n. akinapally n. krishnadas s. rangappa s. janardhanan

the novel bicyclo thieno 1, 2, 3-triazines (btt) namely btt-1, btt-2, btt-3 and btt-4 were evaluated for analgesic anti-inflammatory and antiarthritic activity. analgesic and anti-inflammatory activity was evaluated using hot plate test , formalin induced paw licking test and formalin induced paw edema test respectively, complete fruend’s adjuvant (cfa) induced arthritis model was used for anti...

Journal: :Cognition & emotion 2013
Lyn Ellett Rhani Allen-Crooks Adele Stevens Tim Wildschut Paul Chadwick

A growing body of research shows that paranoia is common in the general population. We report three studies that examined the Prisoner's Dilemma Game (PDG) as a paradigm for evaluation of non-clinical paranoia. The PDG captures three key qualities that are at the heart of paranoia--it is interpersonal, it concerns threat, and it concerns the perception of others' intentions towards the self. St...

G.L. Viswanatha, N. Akinapally, N. Krishnadas, S. Janardhanan, S. Rangappa,

The novel bicyclo thieno 1, 2, 3-triazines (BTT) namely BTT-1, BTT-2, BTT-3 and BTT-4 were evaluated for analgesic anti-inflammatory and antiarthritic activity. Analgesic and anti-inflammatory activity was evaluated using hot plate test , formalin induced paw licking test and formalin induced paw edema test respectively, complete fruend’s adjuvant (CFA) induced arthritis model was used for anti...

Journal: :SIAM Journal on Discrete Mathematics 2022

Given an edge-coloured graph, we say that a subgraph is rainbow if all of its edges have different colours. Let $\operatorname{ex}(n,H,$rainbow-$F)$ denote the maximal number copies $H$ properly graph on $n$ vertices can contain it has no isomorphic to $F$. We determine order magnitude $\operatorname{ex}(n,C_s,$rainbow-$C_t)$ for $s,t$ with $s\not =3$. In particular, answer question Gerbner, M\...

Journal: :Electr. J. Comb. 2017
Zhanar Berikkyzy Alex Shulte Michael Young

The anti-van der Waerden number, denoted by aw([n], k), is the smallest r such that every exact r-coloring of [n] contains a rainbow k-term arithmetic progression. Butler et al. showed that dlog3 ne + 2 6 aw([n], 3) 6 dlog2 ne + 1, and conjectured that there exists a constant C such that aw([n], 3) 6 dlog3 ne + C. In this paper, we show this conjecture is true by determining aw([n], 3) for all ...

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

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