Given a graph class ${\mathscr{H}}$ , the task of -Square Root problem is to decide whether an input G has square root H from . We are interested in parameterized complexity for classes that composed by graphs at vertex deletion distance most k maximum degree one, is, we looking such there modulator S size − disjoint union isolated vertices and edges. show different variants problems with const...

Real-world networks often have power-law degrees and scale-free properties, such as ultrasmall distances and ultrafast information spreading. In this paper, we study a third universal property: three-point correlations that suppress the creation of triangles and signal the presence of hierarchy. We quantify this property in terms of c[over ¯](k), the probability that two neighbors of a degree-k...

In this study we used a modified Stroop word-color task in which the target was a centrally fixated color frame and the distractor was an incompatible, compatible or non-color word. In Experiment 1 distractors were located either within (the inside condition) or outside the frame, at distances of 1.3 deg (near-outside condition) or 2 deg (far-outside condition). In Experiment 2 only the inside ...

At a time when the demand for people with expertise in chemoinformatics is increasing, there is still only a very small number of academic institutions that offer chemoinformatics-related classes and degrees. The distance education (DE) approach allows both learning and research to be carried out at multiple geographic locations and institutions, thus leveraging the few educational offerings th...

Abstract. In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr−1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs a...