The Number of Spanning Trees in Graphs With a Given Degree Sequence

Random Structures and Algorithms - United States
doi 10.1002/rsa.3240060214
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

Optimal Pebbling Number of Graphs With Given Minimum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Towards Random Uniform Sampling of Bipartite Graphs With Given Degree Sequence

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2013English

Number of Spanning Trees of Circulant Graphs C6n and Their Applications

Journal of Mathematics and Statistics
MathematicsStatisticsProbability
2012English

The Number of Subtrees of Trees With Given Diameter

Discrete Mathematics, Algorithms and Applications
CombinatoricsDiscrete Mathematics
2018English

Generating Maximally Disassortative Graphs With Given Degree Distribution

Stochastic Systems
2018English

Trees With Given Maximum Degree Minimizing the Spectral Radius

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2016English

Spectral Radius of Graphs With Given Matching Number

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2007English

Giant Component in Random Multipartite Graphs With Given Degree Sequences

Stochastic Systems
2015English

Laplacian Matrices and Spanning Trees of Tree Graphs

Annales de la faculté des sciences de Toulouse Mathématiques
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy