The tag has no usage guidance.

learn more… | top users | synonyms

0
votes
0answers
22 views

matching Robinson-Foulds distance and way to compute RF dist in Phylip

In Comparison of Phylogenetic Trees, Robinson D.F. and Foulds L.R., didn't show how to compute the RF distance between trees, counting the different partition generated by the removing of an internal ...
1
vote
0answers
159 views

Possible ways to create a graph representation from a distance matrix (through approximation)

Forgive me, Im not math professional, but a computer scientist at the beginning of my base research from my thesis, so bare with me if I miss something blatantly obvious. I have a Euclidean distance ...
2
votes
0answers
57 views

Looking for similar centrality measurement on graph

I'm working on a graph problem somehow related to centrality measurement. Given an undirected, unweighted tree $T$ and a vertex $v$, let $D_i(v)$ be the set of vertices in $T$ that are i hops from ...
3
votes
2answers
276 views

Distance between two networks

Suppose you have networks A and B, each with a set of nodes and edges. You want to measure how similar the networks are to each-other. None of the nodes or edges are labelled. What are the metric(s) ...
0
votes
1answer
121 views

Graphs with circulant distance matrices

The cycle has this property. For instance, the distance matrix for a 6-cycle is: $A=\begin{bmatrix} 0 & 1 & 2 & 3 & 2 & 1 \\\\ 1 & 0 & 1 ...
3
votes
2answers
229 views

Graphs with a unique transmission value

If $G$ is a graph with distance function $d(x,y)$ between vertices, the transmission of a vertex $x \in v(G)$ is defined as $\sigma_{x}=\sum_{y \neq x}{d(x,y)}$. I want to know if there is a known ...