Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [adjacency]

The tag has no usage guidance.

1
vote
1answer
34 views

How to find efficiently the independent vertex sets from a large adjacency matrix?

I have a binary adjacency matrix $M$ of size $72\times 72$. I would like to find all possible combinations of 18 non-adjacent nodes. There are $^{72}C_{18}$ possible (adjacent and non-adjacenct) ...
1
vote
0answers
24 views

How to form sets of non-adjacent subgraphs from all possible subgraphs and the adjacency matrix?

I have connected graph with $72$ nodes. The binary adjacency matrix of the connected graph is $A$. The size of $A$ is $72\times 72$ and its symmetric. I have generated all possible subgraphs ($17000$...
0
votes
1answer
138 views

How to form subgraphs from a connected graph

I have a connected graph with 72 nodes and its binary adjacency matrix. I need to find all possible connected subgraphs with exactly 6 nodes, i.e., I need to find all connected subgraphs and each ...
17
votes
2answers
352 views

How to build a neighbor table for the Hexagonal lattice

I want to consider a collection of vertices arranged in a finite Hexagonal lattice, with say $n_{r}$ rows and $n_{x}$ vertices per row, for a total of $N = n_{x}n_{r}$ vertices. The goal is to ...
3
votes
3answers
157 views

How do I assign vertex colors based upon a specified partition of the nodes?

I'm using AdjacencyGraph to plot a graph corresponding to an undirected, unweighted 5-node network. Each node is assigned a different color. Here's what I have so ...
1
vote
1answer
68 views

Centralities in Weighted Networks

I have a weighted, undirected network with five nodes, whose adjacency matrix is given by ...
8
votes
1answer
211 views

Constructing Icosahedral Fullerene Graphs

I am interested in constructing graphs of icosahedral fullerenes, following the construction explained in the first few pages of this article (alternate link). Mathematica has built-in information ...
3
votes
2answers
176 views

Network Visualization - AdjacencyGraph - no overlapping vertices

I currently plotted a graph with the following code: ...
3
votes
1answer
132 views

Biggest component searching in a 3 dimensional torus graph

I made a Mathematica code, which search the biggest component of red points in a 3-dimensional, $n\times n\times n$ torus graph. The torus points are drawed red color with the probability of p, the ...
0
votes
0answers
199 views

How to build file to be used in Gephi 0.9.1?

I have an adjacency matrix obtained by: ...
0
votes
1answer
90 views

AdjacencyGraph: change edgestyle in combination with KCoreComponent

For this example I work with the next dataset: ...
1
vote
1answer
66 views

Is there a way to improve the performance of this code in order to reduce the time needed?

I'm working with binary protein interactions, and with the data that I have I use Mathematica to generate a Graph with all the interactions. Since most of the organisms have thousands of proteins and ...
7
votes
1answer
138 views

Can I label duplicate edges differently within adjacency graph?

I want to label a duplicate edge I have with different labels in an adjacency graph. So far I have this: ...
0
votes
0answers
23 views

Sparse (Weighted) Adjacency Matrix & SparseArray: encoding multiple weights at a given edge [duplicate]

Context Below is just an arbitrary example. It is not perfect, but hopefully it serves the point of what I would like to accomplish. Say you have a sparse adjacency matrix, $\bf{A}$, where a value ...
2
votes
1answer
167 views

Permutations on graph vertex labels

I want to generate all the possible adjacency matrices of equivalent unlabeled graphs. For example, consider the simple path graph of three vertices. There are three possible adjacency matrices: <...