Questions about handling graphs in Mathematica, graph theory, graph visualization, GraphPlot, the built-in Graph type and the Combinatorica` package.

learn more… | top users | synonyms (2)

0
votes
0answers
32 views

Create graph K5, delete 2 edges and 2 vertex, create adjacency matrix [duplicate]

I need help about this problem. I should create graph K5, delete 2 edges and 2 vertex from it and from the new graph create adjacency matrix. I have poor knowledge and i don't need anyone to solve the ...
2
votes
1answer
62 views

DeleteVertex in Kpartite graph

How can i make K7,2 graph and how can i delete 2 vertex? Btw, i need to use package -> Combinatorica`; I tried this: ...
1
vote
2answers
52 views

Graph not drawing after VertexDelete

I'm very new to Mathematica and am currently trying the VertexDelete function, but after using it, my graph isn't drawing. Input: ...
7
votes
0answers
48 views

Question about TransitiveReductionGraph

In Mathematica 10.0 and 10.1, according to the documentation of TransitiveReductionGraph: The transitive reduction h of a graph g is a graph that has the same ...
4
votes
0answers
71 views
3
votes
1answer
58 views

How to use the edge routing of LayeredDigraphEmbedding when specifying explicit vertex coordinates?

The "LayeredDigraphEmbedding" GraphLayout uses an edge routing algorithm which produces nice and readable diagrams and curved ...
5
votes
3answers
182 views
3
votes
1answer
107 views

Can I make a simple game in Mathematica?

Here is the game outline: $\hspace{2.5cm}$ There is one player. The player ($\mathscr{L}$) moves from node to node limited by the directed arrows. As the player moves, $\mathscr{G}_{\Huge\cdot}$ ...
1
vote
0answers
100 views

Using NMinimize to solve the Multi Commodity Flow problem

I have the following optimization problem and I was hoping to solve it with NMinimize. Unfortunately, I don't get the desired result. I would like to get an optimal vector for $d_{e}$. This is how ...
0
votes
0answers
45 views

“Real Graph example” to test algorithms

I wrote some algorithms which process graphs. I tested them and found those ones worked. But I would like to demonstrate them too. What is the best way to create example graphs from real world? I ask ...
-2
votes
1answer
44 views

FindShortestPath does not work

The FindShortestPath doesn't work in this graph, can someone tel me what's wrong? ...
2
votes
1answer
74 views

How do I get the adjacency Matrix from a random graph [closed]

I am using the command g = RandomGraph[{8, 13}]; GraphPlot[g, VertexLabeling -> True] to plot a random graph with n nodes and l edges. Once the program has ...
2
votes
1answer
49 views

Efficient Implementation of Resistance Distance for graphs?

Is there an implementation of the resistance distance matrix (or just resistance matrix) for graphs available in Mathematica?
1
vote
1answer
127 views

Distinguishing left from right adjacent triangles in triangle mesh

What I'm trying to do: I'm trying to create a path-drawing function which will produce a path like the one I-P in the diagram below. The way this path was generated requires me to swap between the ...
1
vote
1answer
62 views

Constructing an I-graph

I am attempting to build I-graphs in MMA, i.e. the non-Generalized Petersen graphs, and I found some code from Eric Weisstein, but this is now outdated and doesn't run. I have attempted to switch the ...
0
votes
0answers
26 views

Strange behaviour of VertexEccentricity when switching from map to thread

I want to get a list of vertex eccentricies for all vertices in a graph. This example works just fine: ...
3
votes
2answers
144 views

Test if directed graph is connected

Is there a simple built-in way to check if a directed graph is connected? Now, before you throw ConnectedGraphQ or ...
3
votes
0answers
132 views

How can I scrape the social network for a subset of users in Twitter?

Clearly one cannot scrawl the entire network... but I'd like to extract a statistically representative sample from the network. More specifically, I'd like to access the graph induced by scraping the ...
0
votes
1answer
107 views

Displaying a bipartite graph in Wolfram Mathematica

Which is the function that can plot me the bipartite graph $K_{7, 2}$ in Mathematica? And after that to delete 2 edges?? Thanks for the help.
4
votes
2answers
125 views

Limit FindMinimumCostFlow function to one vertex per path

I want find a set of paths through a graph that maximise flow and minimise cost set on each Edge. However, I have an additional constraint where each Vertex can only be visited once. Mathematica has ...
1
vote
2answers
82 views

Find all perfect matchings of a Graph

I'm trying to find all perfect matchings for some bipartite graphs. For example ...
4
votes
1answer
57 views
5
votes
2answers
77 views
7
votes
3answers
364 views

How to remove all dead ends from a undirected graph?

so what I want to do is take an undirected graph, and remove all the "dead ends" (that is, vertices that are attached to only one other vertex), but do it in such a way that it does it until reaches ...
8
votes
2answers
171 views

Relaxation of Mass-Spring System with Pinned Masses

Problem Assume that four masses are connected to each other by springs while two of them are pinned down at their initial positions. Find the position of masses when system is at its minimum ...
0
votes
1answer
77 views

Cannot find a way to display an adjacency matrix [closed]

I have a question about face adjacency graphs. Suppose that I have an adjacency matrix How can I plot something like this?? I tried and it looks too messy. What may be the resulting graphic? Thank ...
1
vote
1answer
44 views

Graph Edit Distance with Mathematica?

Is there any way to calculate similarity of graphs or the graph edit distance in Mathematica ?
5
votes
0answers
128 views

How to generate a random flow graph?

A flow graph is a rooted directed graph that the root reaches all other vertices. I need to generate a random flow graph in Mathematica. My idea is to use ...
2
votes
0answers
33 views

Custom graph distribution

I am working with random graphs a lot. It's quite easy to describe random graph using, adjacency matrix or just a list of edges. However I am thinking that I might benefit from describing random ...
1
vote
1answer
52 views

Finding adjacency matrix of a Mathematica's in-built graph? [closed]

I want to get the adjacency matrix of an in-built graph, say the dodecahedral graph. Naively using AdjacencyMatrix[Dodecahedral] doesn't give it to me. Any ...
1
vote
0answers
28 views

ConnectedComponents problem of syntactic structure

In Mathematica 10, ConnectedComponent computes the list of vertices belonging to strongly connected components. In the following simple example with a graph with no edges, the result is as follows: ...
1
vote
0answers
55 views

Twilight Zelda Guardian Puzzle : Shortest Path Proof [closed]

I'm playing a video game right now and in it is a puzzle (see here). There are solutions to solving it (see here) on the Internet, but I'd like to know if this path is the shortest path (least amount ...
2
votes
1answer
38 views

Logic behind Graph[edges, VertexLabels -> “Name”]?

I find VertexLabels -> "Name" a strange setting to achieve graph nodes labeled by their index: ...
9
votes
4answers
266 views

Multiple Forms of Transportation Between Cities

I want to be able to show different connections between cities based on modes of transportation. For instance, you could walk to any city, but it would take a long time, you could take a train, but ...
1
vote
0answers
25 views

DataRange not working in GraphPlot

I am trying to create a a GUI that uses the GraphPlot function to automatically generate graph vertices. I am using the VertexCoordinateRules option to designate that I want some of the vertices to be ...
7
votes
1answer
204 views

How to set the Y coordinates for a Graph with defined X coordinates to prevent overlap of nodes?

I would like to draw a Graph with defined $x$ coordinates and variable node sizes. If I simply replace the $x$ coordinates of a graph, then nodes can overlap and ...
1
vote
1answer
135 views

Getting coordinates of a embedded graph [closed]

I have to show how spring embedding works by displaying step-by-step images of a GridGraph[10x10] being embedded from a initial circular form to the final form, which should look somewhat like this: ...
0
votes
1answer
55 views

Import mixed graph from Excel

I am new to Mathematica. I want to use the software as it allows analysis of mixed graphs (directed and undirected edges). I have my network as an Excel spreadsheet of three columns: source, target ...
2
votes
1answer
78 views

Plot a tripartite Graph with its groups separated

I would like to create a Graph like the following: but without edges between vertices in the same group. so I have a graph and I want to plot it such that its ...
4
votes
2answers
159 views

Using GraphData to generate all directed graphs with n vertices

Using Combinatorica, it was possible to generate unlabeled (non-isomorphic) directed graphs of $|V|=n$. Here the example is for $n=4$: ...
0
votes
2answers
56 views

Question RE DiscreteMarkovProcess Graph Labels

I'm trying to label the arc's of my Markov chain with symbols like $\alpha$, $\beta$, etc., to show how the Markov chain looks abstractly. So, I did this... ...
8
votes
2answers
175 views

Finding the minimum vertex cut of a graph

Bug present in at least versions 9.0.1, 10.0.2 and 10.1.0 It seems that Mathematica is not correctly finding the smallest set of vertices that will disconnect a graph. Here is an example: ...
-3
votes
1answer
65 views
2
votes
1answer
330 views

Display a labeled multigraph

Introduced in version 9, fixed in version 10. Thanks Szabolcs for providing this screenshot showing that the bug is fixed. Despite the integration of graphs and networks, multigraphs are ...
4
votes
1answer
74 views
6
votes
2answers
393 views

Don't understand why Mathematica is complaining about my Graph expression; how can I fix it?

The Tube in Arrow problem is fixed in version 10. Note that in version 10 Graph3D must be ...
8
votes
2answers
315 views

Finding All Chordless Simple Cycles In A Graph

I am doing a research on networks which consists of polygons with different number of sides. I am trying to find all simple cycles in a network which are chordless. As an example, consider the ...