Geodesic
Edit distance measure for graphs
Czechoslovak Mathematical Journal, Tome 65 (2015) no. 3, pp. 829-836.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

In this paper, we investigate a measure of similarity of graphs similar to the Ramsey number. We present values and bounds for $g(n,l)$, the biggest number $k$ guaranteeing that there exist $l$ graphs on $n$ vertices, each two having edit distance at least $k$. By edit distance of two graphs $G$, $F$ we mean the number of edges needed to be added to or deleted from graph $G$ to obtain graph $F$. This new extremal number $g(n, l)$ is closely linked to the edit distance of graphs. Using probabilistic methods we show that $g(n, l)$ is close to $\frac 12\binom n2$ for small values of $l>2$. We also present some exact values for small $n$ and lower bounds for very large $l$ close to the number of non-isomorphic graphs of $n$ vertices.
DOI : 10.1007/s10587-015-0211-4
Classification : 05C35, 05C75
Keywords: extremal graph problem; similarity of graphs 
@article{10_1007_s10587_015_0211_4,
     author = {Dzido, Tomasz and Krzywdzi\'nski, Krzysztof},
     title = {Edit distance measure for graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {829--836},
     publisher = {mathdoc},
     volume = {65},
     number = {3},
     year = {2015},
     doi = {10.1007/s10587-015-0211-4},
     mrnumber = {3407608},
     zbl = {06537695},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1007/s10587-015-0211-4/}
}
TY  - JOUR
AU  - Dzido, Tomasz
AU  - Krzywdziński, Krzysztof
TI  - Edit distance measure for graphs
JO  - Czechoslovak Mathematical Journal
PY  - 2015
SP  - 829
EP  - 836
VL  - 65
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.1007/s10587-015-0211-4/
DO  - 10.1007/s10587-015-0211-4
LA  - en
ID  - 10_1007_s10587_015_0211_4
ER  - 
%0 Journal Article
%A Dzido, Tomasz
%A Krzywdziński, Krzysztof
%T Edit distance measure for graphs
%J Czechoslovak Mathematical Journal
%D 2015
%P 829-836
%V 65
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.1007/s10587-015-0211-4/
%R 10.1007/s10587-015-0211-4
%G en
%F 10_1007_s10587_015_0211_4
Dzido, Tomasz; Krzywdziński, Krzysztof. Edit distance measure for graphs. Czechoslovak Mathematical Journal, Tome 65 (2015) no. 3, pp. 829-836. doi : 10.1007/s10587-015-0211-4. http://geodesic.mathdoc.fr/articles/10.1007/s10587-015-0211-4/

Cité par Sources :