let $g$ be a connected graph with vertex set $v(g)$‎. ‎the‎ ‎degree resistance distance of $g$ is defined as $d_r(g) = sum_{{u‎,‎v} subseteq v(g)} [d(u)+d(v)] r(u,v)$‎, ‎where $d(u)$ is the degree‎ ‎of vertex $u$‎, ‎and $r(u,v)$ denotes the resistance distance between‎ ‎$u$ and $v$‎. ‎in this paper‎, ‎we characterize $n$-vertex unicyclic‎ ‎graphs having minimum and second minimum degree resista...

This article examines the basic social science concepts of "power" and "social exchange" in order to determine the possibility and desirability of integrating them. It is argued that: (1) all exchange relationships can be described in terms of conventional power concepts without twisting the common-sense notions that underlie such concepts; (2) most-but not necessarily all-power relationships c...

Stoic behavior is defined as a behavior in which students tend not to seek help with a challenge. We investigated two types of stoic behavior: keeping-off behavior, in which students restrain themselves from requesting help, i.e., keep levels of help support at a minimum, and self-fading behavior, in which students voluntarily lower levels of support on their own volition. Three experiments wer...

This paper argues that the Invertible Construction (IC) in Chinese is a kind of distributive construction. What appears to be an inversion of word order is best understood as the division of the theme NP to be acted upon by a number of agents for an embedded event. This analysis best captures a number of otherwise intractable properties of the IC including the necessarily quantitative interpret...

Knowledge has proven to be a useful and fundamental formalism for reasoning about distributed systems. The application of this formalism, however, entails a loss of volition on the part of processes about which something is known. This loss of volition is often not appropriate in loosely coupled distributed systems. In this paper, we generalize the formal characterization of knowledge into one ...

We give a simple proof based on symmetries that there are no geodesics from vertex to itself in the cube, tetrahedron, octahedron, and icosahedron.

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.