nties

<code>nties</code> returns the number of possible edges in each element of <code>dat</code>, given <code>mode</code> and <code>diag</code>.

 math

 graphs

 univar 

A range of tools for social network analysis, including node and graph-level indices, structural distance and covariance methods, structural equivalence detection, network regression, random graph generation, and 2D/3D network visualization.

Carter Butts

Tools for Social Network Analysis

nties function

<dl> <dt>dat</dt>
<dd>a graph or set thereof.</dd> <dt>mode</dt>
<dd>one of ``digraph'', ``graph'', and ``hgraph''.</dd> <dt>diag</dt>
<dd>a boolean indicating whether or not diagonal entries (loops) should be treated as valid data; ignored for hypergraphic (``hgraph'') data.</dd></dl>

Arguments

Carter T. Butts <a href="/link/buttsc%40uci.edu?package=sna&version=2.8" data-mini-rdoc="sna::buttsc@uci.edu">buttsc@uci.edu</a>

Author

Find the Number of Possible Ties in a Given Graph or Graph Stack — nties

<dl>

 <dt>dat</dt>
<dd>a graph or set thereof.</dd>

 <dt>mode</dt>
<dd>one of ``digraph'', ``graph'', and ``hgraph''.</dd>

 <dt>diag</dt>
<dd>a boolean indicating whether or not diagonal entries (loops) should be treated as valid data; ignored for hypergraphic (``hgraph'') data.</dd>

</dl>

Carter T. Butts <a href='mailto:buttsc@uci.edu'>buttsc@uci.edu</a>

nties: Find the Number of Possible Ties in a Given Graph or Graph Stack

Description

Usage

Value

Arguments

Author

Details

Examples