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
43 views

Computing Domination Numbers of Graphs

Is there a way to get Mathematica to compute the domination number (size of the smallest dominating set) of a graph? There doesn't seem to be a direct command for this, so I'm not sure if there would ...
0
votes
0answers
27 views

“Partial” graph layout (with a fixed core)?

Is there a way to apply a graph lay out algorithm to a Graph object in such a way that a subset of its vertices and a subset of its edges are fixed beforehand, and ...
0
votes
0answers
38 views

NMinimize outside the feasible region

I got the following minimization problem. I get a solution if I set constraints1 := L.x >= y; and eliminate constraint 2 from my set of constraints. So ...
0
votes
0answers
73 views

Mathematically Eliminated in Baseball

Earlier today the Yankees were mathematically eliminated from the playoffs. Determining when this condition is satisfied for any given team is complicated but can be solved as a maximum flow problem, ...
0
votes
0answers
39 views

Graph embedding and edge weights [duplicate]

Does functions like GraphPlot take in to account edge weights in case of springelectrical embedding? In case of spring electrical embedding I expect the vertices connected by heavy edges to be pulled ...
0
votes
0answers
34 views

Find set of subgraphs of g1 isomorphic to g2 [duplicate]

I would like to find all the subgraphs of a given graph g that are isomorphic to the graph h. My current code doesn't work how it should. Many solutions are missed and I think something is ...
0
votes
0answers
55 views

how to rewire the minimum number of edges in a disconnected bipartite graph, so to transform it in a connected one

Consider an incidence matrix A for a bipartite graph (Aij=1 if node i of group 1 and node j of group 2 are connected). A is not symmetric. Assume that A is disconnected or only weakly connected, i.e. ...
0
votes
0answers
97 views

Centrality measures and normalisation

Are centrality measures normalised in Mathematica 9? Only ClosenessCentrality is normalised. How I can normalise other centrality measures notably ...
0
votes
0answers
46 views
-1
votes
1answer
68 views

How to draw a network from a dataset reporting the labels of nodes of every link?

I have a dataset in format .txt of a directed network, containing a matrix A of dimension ...
-1
votes
0answers
28 views

Graph Theory Cut Vertex [on hold]

so I recently started learning about the graph theory and i came about this question: Show that a vertex c in the connected simple graph G is a cut vertex if and only if there are vertices u and ...
-2
votes
0answers
15 views

Independence Number of Graphs [on hold]

Suppose $\alpha(G)\leq\alpha(H)$ where $G$ and $H$ are graphs, and $\alpha(.)$ is the independence number of graph. Is the following statement true? $\alpha(G\boxtimes G) \leq \alpha(H\boxtimes H)$ ...