News

Let G be a graph of order n and let S be any subset of the vertex set V (G). Denote by GS the graph obtained from the graph G by adding a new vertex x which is adjacent exactly to the vertices from S.
This article examines the descriptive power of the adjacency pair as a basic unit of conversational organization. It applies the notion to the analysis of conversational data and points out that there ...