Vol. 9, No. 3, 2020

Download this article
Download this article For screen
For printing
Recent Issues
Volume 11, Issue 4
Volume 11, Issue 3
Volume 11, Issue 2
Volume 11, Issue 1
Volume 10, Issue 4
Volume 10, Issue 3
Volume 10, Issue 2
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
Older Issues
Volume 7, Issue 4
Volume 7, Issue 3
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 4
Volume 6, Issue 2-3
Volume 6, Issue 1
Volume 5, Issue 4
Volume 5, Issue 3
Volume 5, Issue 1-2
Volume 4, Issue 4
Volume 4, Issue 3
Volume 4, Issue 2
Volume 4, Issue 1
Volume 3, Issue 3-4
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 4
Volume 2, Issue 3
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 4
Volume 1, Issue 3
Volume 1, Issue 2
Volume 1, Issue 1
The Journal
About the Journal
Editorial Board
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
founded and published with the
scientific support and advice of
mathematicians from the
Moscow Institute of
Physics and Technology
ISSN (electronic): 2640-7361
ISSN (print): 2220-5438
Author Index
To Appear
Other MSP Journals
This article is available for purchase or by subscription. See below.
Weakly distinguishing graph polynomials on addable properties

Johann A. Makowsky and Vsevolod Rakita

Vol. 9 (2020), No. 3, 333–349

A graph polynomial P is weakly distinguishing if for almost all finite graphs G there is a finite graph H that is not isomorphic to G with P(G) = P(H). It is weakly distinguishing on a graph property 𝒞 if for almost all finite graphs G 𝒞 there is H 𝒞 that is not isomorphic to G with P(G) = P(H). We give sufficient conditions on a graph property 𝒞 for the characteristic, clique, independence, matching, and domination and ξ polynomials, as well as the Tutte polynomial and its specializations, to be weakly distinguishing on 𝒞. One such condition is to be addable and small in the sense of C. McDiarmid, A. Steger and D. Welsh (2005). Another one is to be of genus at most k.

PDF Access Denied

We have not been able to recognize your IP address as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recom­mendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 40.00:

graph polynomials, random graphs, Bollobás–Pebody–Riordan conjecture, addable graph classes
Mathematical Subject Classification 2010
Primary: 05C31
Secondary: 05C10, 05C30, 05C69, 05C80
Received: 5 December 2019
Revised: 1 March 2020
Accepted: 19 March 2020
Published: 15 October 2020
Johann A. Makowsky
Department of Computer Science
Technion - IIT
Haifa, Israel
Vsevolod Rakita
Department of Computer Science
Technion - IIT
Haifa, Israel