The rank of a graph is defined to be the its adjacency matrix. A called reduced if it has no isolated vertices and two with same set neighbors. G said maximal any containing as proper induced subgraph higher rank. main intent this paper present some results on graphs. First, we introduce characterization trees (a tree not subtree rank). Next, give near-complete ‘generalized friendship graphs.’ ...

Salkovskis [1985. Obsessional-compulsive problems: A cognitive-behavioural analysis. Behaviour Research and Therapy, 23, 571-583.] hypothesized that intrusive thoughts are more likely to occur if the thought is salient for the individual, triggers feelings of responsibility and if the individual attempts to suppress the thought. The relationship between these three factors (responsibility, sali...