Hostname: page-component-7b7567c8c-8tzhz Total loading time: 0 Render date: 2026-11-19T15:20:35.498Z Has data issue: false hasContentIssue false

The magnitude of a graph

Published online by Cambridge University Press:  27 November 2017

TOM LEINSTER*
Affiliation:
School of Mathematics, University of Edinburgh, James Clerk Maxwell Building, The King's Buildings, Peter Guthrie Tait Road, Edinburgh EH9 3FD. e-mail: Tom.Leinster@ed.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The magnitude of a graph is one of a family of cardinality-like invariants extending across mathematics; it is a cousin to Euler characteristic and geometric measure. Among its cardinality-like properties are multiplicativity with respect to cartesian product and an inclusion-exclusion formula for the magnitude of a union. Formally, the magnitude of a graph is both a rational function over ℚ and a power series over ℤ. It shares features with one of the most important of all graph invariants, the Tutte polynomial; for instance, magnitude is invariant under Whitney twists when the points of identification are adjacent. Nevertheless, the magnitude of a graph is not determined by its Tutte polynomial, nor even by its cycle matroid, and it therefore carries information that they do not.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 2017