Chromatic zeros for some recursively defined families of graphs

31 mins 20 secs,  433.63 MB,  MPEG-4 Video  480x360,  25.0 fps,  44100 Hz,  1.84 Mbits/sec
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Bielak, H (Maria Curie-Sklodowska)
Thursday 24 January 2008, 16:00-16:30
Zeros of Graph Polynomials
 
Created: 2008-02-07 10:40
Collection: Combinatorics and Statistical Mechanics
Publisher: Isaac Newton Institute
Copyright: Bielak, H
Language: eng (English)
Distribution: World     (downloadable)
Credits:
Author:  Bielak, H
Explicit content: No
Aspect Ratio: 4:3
Screencast: No
Bumper: /sms-ingest/static/new-4x3-bumper.dv
Trailer: /sms-ingest/static/new-4x3-trailer.dv
 
Abstract: We consider some infinite families of recursively defined graphs. The explicite formulas for chromatic polynomials of graphs from the families will be presented. We study the problem of the location of their complex zeros.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video * 480x360    1.84 Mbits/sec 433.63 MB View Download
WebM 480x360    416.78 kbits/sec 95.70 MB View Download
Flash Video 480x360    803.22 kbits/sec 184.92 MB View Download
iPod Video 480x360    505.24 kbits/sec 116.32 MB View Download
QuickTime 384x288    847.73 kbits/sec 195.17 MB View Download
MP3 44100 Hz 125.04 kbits/sec 28.58 MB Listen Download
Windows Media Video 477.16 kbits/sec 109.86 MB View Download
Auto (Allows browser to choose a format it supports)