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)

2
votes
1answer
41 views

Certainty of the New Vertex Name after using EdgeContract

It appears that when I use EdgeContract on an undirected graph, the vertex that is the result of contracting an edge is always named the smaller of the two vertices....
3
votes
1answer
18 views

Why does Mathematica report the VertexEccentricity of a disconnected vertex as zero?

"For a disconnected graph, all vertices are defined to have infinite eccentricity" So, why does Mathematica report the VertexEccentricity of a disconnected vertex as 0 instead of ...
1
vote
1answer
28 views

VertexContract, VertexReplace and non-anonymous collapsed node

Can the standard VertexContract or VertexReplace functions display a name for the collapsed node ? Here is a minimal example: <...
2
votes
1answer
58 views

Trying to remove duplicate isomorphic graphs in a list of graphs [duplicate]

I am working on a Mathematica program that involves taking a graph and generating all of its single-edge contractions. When I get this list of contractions, it often happens that many of the graphs ...
3
votes
1answer
65 views

How can I get the arguments of the function Graph?

If I have f0 = f[x,y,z] and I am interested in the list of the arguments, what I do is ...
9
votes
1answer
156 views

Petrie polygon projection of a hypercube graph

I am trying to generate the Petrie polygon projection of the 8-cube in Mathematica, like this one: I tried using, for example, the HypercubeGraph function: ...
0
votes
0answers
15 views

Acyclic Directed Graph, NeighborhoodGraph and ancestors [duplicate]

What is the correct way of find the list of a given vertex' ancestors in an ADG ? I am thinking that a pattern in NeighborhoodGraph might be the solution or a negative option for the degree of ...
3
votes
1answer
68 views

Find independent vertex sets

I'm trying to find all independent vertex sets for a given graph. Note that they may not be maximal independent sets. There is a function in Mathematica called ...
8
votes
2answers
239 views

Plot a 3-cycle graph with clockwise-directed edges

When I try to plot a 3-cycle, the edge direction is always counter-clockwise. The plotting code is ...
6
votes
2answers
126 views

Small World network on a square grid

My aim is to generate a 2D Small World network on a square grid. i.e. 20x20. With a probability of 5%, one node rewires from an adjacent node to a random node of the grid, allowing some long distance ...
2
votes
0answers
131 views

How to make a flowchart? [closed]

I'd like to make a flow chart in similar to this: I think it's more of a layout and stylistic question for a graph - how to style a graph with labeled edges and vertices so that it looks like a ...
1
vote
1answer
50 views

Trying to get simple excel data to be imported as a social network directed graph

My data has two columns that we'll call A and B. The columns proceed as such A B A1 B1 A2 B2 A3 B3 .... I'm trying to make this into a directed graph where A1 has an outgoing edge to B1 and ...
3
votes
2answers
147 views

Deleting vertices from a Graph and preserving structure

My goal is to remove vertices from graphs (and the edges from them) and then take GraphComplement to find out cut sets in graphs with sink and source such as here. ...
3
votes
3answers
111 views

Random bipartite graphs?

RandomGraph[{n,m}] generates a random graph with $n$ vertices and $m$ edges. I want to generate a random bipartite graph, like ...
2
votes
2answers
108 views

VertexDelete Problem

I am doing a straightforward deletion of a set of vertices in a Tree using Mathematica. ...
4
votes
2answers
123 views

How can I make this code to count Hamiltonian paths faster?

I have this very basic code to count Hamiltonian paths in a graph: ...
10
votes
1answer
91 views

Arrows from GraphicsComplex not converted to Normal form correctly

Bug introduced in 7.0 or earlier and persisting through 10.4.0 Show @ Graph[{1 -> 2, 2 -> 3}, Frame -> True] Normal @ % Is this a pure bug, or have ...
5
votes
0answers
54 views

What's meaning of `VertexConnectivity`?

Are there a conflict in this two place in documentation? In the Basic Examples: Then the Properties & Relations But actually:
0
votes
0answers
66 views

Plotting a graph on a torus and another surfaces [duplicate]

I'm trying to figure out how to plot a graph on a surface. My goal is to represent a planar embedding of $ K_5$ in a torus. I have encountered this post, where you can find an explanation how to plot ...
2
votes
1answer
73 views

VertexLabels with Graph Properties

Suppose I have a graph like this Graph[ {1 <-> 2, 2 <-> 3, Labeled[3 <-> 1, "hello"]}, VertexLabels -> Placed["Name",StatusArea] ] Now ...
3
votes
1answer
65 views

Generate list of traceable and planar graphs

Is there any way to tell Mathematica to generate a list of graphs that are both traceable and planar?
14
votes
2answers
317 views

Zoom in on a 2D graph

I have seen many queries on zooming in on plots etc. But I haven't seen any regarding 2D graphs. For eg if I have a graph like Graph[{1->2, 2->3, 3->1}]. ...
3
votes
1answer
152 views

Hasse Diagrams from Adjacency Matrix

Let's say I have a rather large adjacency matrix for a partial order relation. Say an 80x80 matrix. What is the best way to display Hasse diagram? I have tried AdjacencyGraph and it does a not so bad ...
15
votes
1answer
332 views

GeoGraphics : path within a country

I am using GeoGraphics to visualize electricity distribution networks in certain countries. I have susbtation location data, as well as network incidence matrices (...
9
votes
1answer
142 views

Deleting zero edges from a graph causes bizarre behavior

Bug introduced in 10.3.0 and fixed in 10.4. Consider the following (very simple) graph, with two vertices and one edge: g = Graph[{1, 2}, {1 <-> 2}]; I ...
21
votes
2answers
398 views

Reconstruct a graph from an image (curved edges and edge crossings)

Actually, I posted a very similar question before this.How to generate a Graph from a picture of a graph Dr. belisarius's answer have answered that question, but I find a limitation in that method: ...
1
vote
0answers
55 views

Is there a way to update a graph in place?

I'm assembling graphs programmatically, and looping through EdgeAdd[] a lot. graph = EdgeAdd[graph, a -> b]; Is there a more efficient way to do the updates ...
12
votes
1answer
275 views

How to generate a Graph from a picture of a graph?

I have a picture like this I can get this graph's vertexes ...
5
votes
2answers
139 views

How to use Mathematica to calculate number of spanning tree?

As the title,The graph g is: ...
1
vote
1answer
55 views

How to set color for some graph's vertex? [closed]

I defined graph and got this visualization ...
1
vote
1answer
81 views

Combinatorica and DualPartition function (for a Young diagram)

I am trying to understand how to evaluate the arm and leg functions of a Young tableaux using Mathematica. To do so I need the Combinatorica package. Then apparently the command ...
0
votes
0answers
85 views

How to graph the all of the possible isomorphic graph?

We can get one form of it use Graph ...
6
votes
2answers
66 views

How to specify custom graph styles for `GraphStyle`?

There is a way to specify custom themes for plots (Is it possible to define a new PlotTheme?), but themes to not apply to Graph objects, not even to ...
1
vote
3answers
59 views

How to draw graph with named vertices by adjacency matrix?

I have the adjacency matrix of graph and I want visualize this graph. I tried: ...
5
votes
1answer
161 views

What exactly does LocalClusteringCoefficient compute for directed graphs?

For undirected graphs, the LocalClusteringCoefficient of vertex v is ...
1
vote
1answer
106 views

Visualizing Matrix that represents a network

I have a nxn matrix $A$ that represents a network. I have $n$ nodes in the network, and the matrix $A$ represents the number of connection (edges) between the different nodes. For example, if $A$=0, ...
10
votes
1answer
403 views

Shortest tour with vertex priority

I changed the title of my question and tried to simplify formulation of the problem. I solve a very big vehicle routing problem. I divided this one big problem on many small sub-problems. Each small ...
6
votes
1answer
120 views

Networkgraph, Thickness of edges based on calculated values

On this blogsite I've read a interesting blog about visualising a correlation matrix. So I started with a simple file like: ...
4
votes
1answer
282 views

Graphs in 3 dimensions

I have a desired graph as here: the dashed line is just for perspective representation. I tried with LayeredGraphPlot and ...
1
vote
1answer
90 views

Labeling the vertices of a graph

I would like to label the vertices of a complete graph alphabetically. But I am stuck because I don't know how to associate only one vertex to a letter. ...
1
vote
1answer
113 views

Import graphml file in mathematica

I am trying import a graphml file I created with NodeXL in mathematica in order to create a network. However when i try to import it I get the error message: "Cannot import data as GraphML format". ...
8
votes
1answer
165 views

Alignment of `TreePlot`

I want to construct a binomial tree using TreePlot but have troubles with the alignment. The code ...
1
vote
1answer
44 views

Medium-sized graph won't build

Why can't Mathematica import a 40-KB file (mediumEWD.txt) and build the underlying graph in some decent time? I waited a minute, nothing. ...
2
votes
1answer
59 views

Highlighting a graph with non-trivial vertex definitions

When defining a graph whose vertices are sets e.g. the Kneser graph, how does Mathematica interpret the vertices? I am having trouble highlighting vertices when I define vertices with sets, but for ...
1
vote
1answer
76 views

Vertices overlap with vertex labels

How to prevent a behavior on a picture below? Why vertices overlap with vertex labels? ...
0
votes
1answer
57 views

How to change vertex font size in TreeGraph?

I tried to change vertex label font size by the following code ...
4
votes
1answer
82 views

How do I change one edge in a tree graph to a double arrow?

I use the following code plot a binary tree and wants to change an edge to double arrow. ...
2
votes
1answer
223 views

Draw a de Bruijn graph with random vertex size

I am trying to draw a graph that looks like below, This the code I have so far, ...
11
votes
2answers
128 views

EdgeAdd function not adding edges to a RandomGraph[ ]

Bug introduced in 9.0 or earlier and persisting through 10.3.1 I have a graph: g = RandomGraph[{1, 0}] So basically, it is just one vertex. I want to add some ...
4
votes
1answer
92 views

Deleting isomorphic graphs efficiently

I'm trying to delete isomorphic graphs from a large list. My solution is as follows: DeleteIsoG1[gl_List]:= Module[{}, DeleteDuplicates[gl,IsomorphicGraphQ]]; ...