The Weisfeiler-Leman dimension of distance-hereditary graphs

05/24/2020
by   Alexander L. Gavrilyuk, et al.
0

A graph is said to be distance-hereditary if the distance function in every connected induced subgraph is the same as in the graph itself. We prove that the ordinary Weisfeiler-Leman algorithm correctly tests the isomorphism of any two graphs if one of them is distance-hereditary; more precisely, the Weisfeiler-Leman dimension of the class of finite distance-hereditary graphs is equal to 2. The previously best known upper bound for the dimension was 7.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2017

The Weisfeiler-Leman Dimension of Planar Graphs is at most 3

We prove that the Weisfeiler-Leman (WL) dimension of the class of all fi...
research
07/25/2022

Pinned Distance Sets Using Effective Dimension

In this paper, we use algorithmic tools, effective dimension and Kolmogo...
research
05/25/2023

On the Weisfeiler-Leman dimension of permutation graphs

It is proved that the Weisfeiler-Leman dimension of the class of permuta...
research
09/10/2019

Novel diffusion-derived distance measures for graphs

We define a new family of similarity and distance measures on graphs, an...
research
01/05/2018

The Reeb Graph Edit Distance is Universal

We consider the setting of Reeb graphs of piecewise linear functions and...
research
05/24/2018

Modular Decomposition of Graphs and the Distance Preserving Property

Given a graph G, a subgraph H is isometric if d_H(u,v) = d_G(u,v) for ev...
research
04/07/2018

ε-Coresets for Clustering (with Outliers) in Doubling Metrics

We study the problem of constructing ε-coresets for the (k, z)-clusterin...

Please sign up or login with your details

Forgot password? Click here to reset