๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An investigation of the coauthor graph

โœ Scribed by Logan, Elisabeth L. ;Shaw, W. M.

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
737 KB
Volume
38
Category
Article
ISSN
0002-8231

No coin nor oath required. For personal study only.

โœฆ Synopsis

The structure of coauthor graphs and the statistical validity of the associated author partitions are investigated as a function of productivity and collaborative thresholds. The productivity threshold determines the number of authors (points) in a coauthor graph, and the collaborative threshold determines the number of coauthor pairs (lines) in the graph. The statistical validity of author partitions is determined by the random-graph hypothesis. The results show that for "small" databases, statistically preferred partitions occur when all authors and coauthor pairs appear in the graph. For "large" databases, statistically preferred partitions occur when authors and coauthor pairs who publish only one article are excluded from the graph. Unlike other bibliometric relationships, the highly selective nature of the collaborative relationship produces a wide range of threshold values for which the associated partitions are statistically valid. It remains to be shown how the statistical validity of partitions is related to the empirical significance of the same partitions.

๐Ÿ“œ SIMILAR VOLUMES

An isomorphic factorization of the compl
An isomorphic factorization of the complete graph
โœ F. K. Hwang ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 194 KB

We give necessary and sufficient conditions that the complete graph K, has an isomorphic factorization into Kr X K,. We show that this factorization has an application to clone library screening.

The cycle space of an embedded graph
The cycle space of an embedded graph
โœ B. Richter; H. Shank ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 258 KB ๐Ÿ‘ 1 views

## Abstract Let __G__ be a connected graph with edge set __E__ embedded in the surface โˆ‘. Let __G__ยฐ denote the geometric dual of __G__. For a subset __d__ of __E__, let ฯ„__d__ denote the edges of __G__ยฐ that are dual to those edges of __G__ in __d__. We prove the following generalizations of wellโ€

The Geodetic Number of an Oriented Graph
The Geodetic Number of an Oriented Graph
โœ Gary Chartrand; Ping Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 149 KB

For two vertices u and v of an oriented graph D, the set I (u, v) consists of all vertices lying on a uv geodesic or vu geodesic in D. If S is a set of vertices of D, then I (S) is the union of all sets I (u, v) for vertices u and v in S. The geodetic number g(D) is the minimum cardinality among the

Every Graph Is an Integral Distance Grap
Every Graph Is an Integral Distance Graph in the Plane
โœ Hiroshi Maehara; Katsuhiro Ota; Norihide Tokushige ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 290 KB

We prove that every finite simple graph can be drawn in the plane so that any two vertices have an integral distance if and only if they are adjacent. The proof is constructive.