On graphs with the maximum number of spanning trees

Authors:
Alexander K. Kelmans
Affiliations:
-
Venue:
Proceedings of the seventh international conference on Random structures and algorithms
Year:
1996

Citing 0
Cited 3

A new technique for the characterization of graphs with a maximum number of spanning trees

Discrete Mathematics - Algebraic and topological methods in graph theory
Laplacian spectra of regular graph transformations

Discrete Applied Mathematics
Can knowledge be more accessible in a virtual network?: Collective dynamics of knowledge transfer in a virtual knowledge organization network

Decision Support Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract