powered by
Returns TRUE iff ego is an isolate in graph g of dat.
g
dat
is.isolate(dat, ego, g=1, diag=FALSE)
A boolean value (or vector thereof) indicating isolate status
one or more input graphs.
index of the vertex (or a vector of vertices) to check.
which graph(s) should be examined?
boolean indicating whether adjacency matrix diagonals (i.e., loops) contain meaningful data.
Carter T. Butts buttsc@uci.edu
In the valued case, any non-zero edge value is taken as sufficient to establish a tie.
Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.
West, D.B. (1996). Introduction to Graph Theory. Upper Saddle River, NJ: Prentice Hall.
isolates, add.isolates
isolates
add.isolates
#Generate a test graph g<-rgraph(20) g[,4]<-0 #Create an isolate g[4,]<-0 #Check for isolates is.isolate(g,2) #2 is almost surely not an isolate is.isolate(g,4) #4 is, by construction
Run the code above in your browser using DataLab