On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties

11/09/2018
by   V. Arvind, et al.
0

We investigate graph properties and parameters that are invariant under Weisfeiler-Leman equivalence, focussing especially on 1-dimensional Weisfeiler-Leman equivalence and on subgraph counts that are preserved. Our main results are summarized below: -- For 1-dimensional Weisfeiler-Leman equivalence, we completely characterize graphs whose: (a) counts are determined by 1-dimensional Weisfeiler-Leman equivalence, and (b) whose presence is determined by 1-dimensional Weisfeiler-Leman equivalence. -- Extending an old result due to Beezer and Farrell for distance-regular graphs, we show that 2-dimensional Weisfeiler-Leman equivalence preserves the first five coefficients of the matching polynomial (and no more). We determine exactly which paths and cycles have their counts determined by 2-dimensional WL-equivalence. -- We also study a notion of "approximate invariance" of graph parameters under Weisfeiler-Leman equivalence. We show that the fractional matching number and fractional domination number are preserved by 1-dimensional Weisfeiler-Leman equivalence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2019

On the Weisfeiler-Leman Dimension of Fractional Packing

The k-dimensional Weisfeiler-Leman procedure (k-WL), which colors k-tupl...
research
01/23/2023

cc-differential uniformity, (almost) perfect cc-nonlinearity, and equivalences

In this article, we introduce new notions cc-differential uniformity, cc...
research
04/29/2021

Graph Similarity and Homomorphism Densities

We introduce the tree distance, a new distance measure on graphs. The tr...
research
01/29/2021

On the Expressive Power of Homomorphism Counts

A classical result by Lovász asserts that two graphs G and H are isomorp...
research
01/09/2023

Structural Equivalence in Subgraph Matching

Symmetry plays a major role in subgraph matching both in the description...
research
04/13/2023

When do homomorphism counts help in query algorithms?

A query algorithm based on homomorphism counts is a procedure for determ...
research
01/24/2022

A note on increasing paths in countable hypergraphs

An old result of Müller and Rödl states that a countable graph G has a s...

Please sign up or login with your details

Forgot password? Click here to reset