I have 4 undirected graph with 1000 vertices and 176672, 150994, 193477, 236060 edges. I am trying to see interaction between a specific set of nodes (16 in number) for each graph. This visualization in tkplot is not feasible as 1000 vertices is already way too much for it. I was thinking of if there is some way to extract the interaction of these 16 nodes from the parent graph and view separately, which will be then more easy to handle and work with in tkplot. I don't want the loss of information as in what is the node(s) in he path of interaction if it comes from other than 16 pre-specified nodes. Is there a way to achieve it? I have their adjacency matrices and igraph objects to work with.
Thank you!
well, I used induced.subgraph instead. But as I said, the nodes which will be interacting in between must not get lost. Here, only those 16 nodes are coming, if the interaction is via some node other than the one specified in 16, is not getting displayed. I want those nodes too in my subgraph.