Jump to ContentJump to Main Navigation
Combinatorics, Complexity, and ChanceA Tribute to Dominic Welsh$
Users without a subscription are not able to see the full content.
Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh

Geoffrey Grimmett and Colin McDiarmid

Print publication date: 2007

Print ISBN-13: 9780198571278

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198571278.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 16 October 2021

FOURIER ANALYSIS ON FINITE ABELIAN GROUPS: SOME GRAPHICAL APPLICATIONS

FOURIER ANALYSIS ON FINITE ABELIAN GROUPS: SOME GRAPHICAL APPLICATIONS

Chapter:
(p.103) 7 FOURIER ANALYSIS ON FINITE ABELIAN GROUPS: SOME GRAPHICAL APPLICATIONS
Source:
Combinatorics, Complexity, and Chance
Author(s):

Andrew Goodall

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198571278.003.0007

This article reviews basic techniques of Fourier analysis on a finite abelian group Q, with subsequent applications in graph theory. These include evaluations of the Tutte polynomial of a graph G in terms of cosets of the Q-flows of G. Other applications to spanning trees of Cayley graphs and to group-valued models on phylogenetic trees are also presented to illustrate methods.

Keywords:   Fourier analysis, abelian groups, graph theory, Tutte polynomial, Cayley graphs, phylogenetic trees

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .