z-logo
Premium
The number of spanning trees in graphs with a given degree sequence
Author(s) -
Kostochka A. V.
Publication year - 1995
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.3240060214
Subject(s) - combinatorics , mathematics , spanning tree , degree (music) , sequence (biology) , graph , upper and lower bounds , minimum degree spanning tree , discrete mathematics , physics , chemistry , acoustics , biochemistry , mathematical analysis
Alon's [1] idea is slightly refined to prove that for each connected graph G with degree sequence 1

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom