Graph details

Graph # 34269

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Most Maximum Matchings Tree 33

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic Yes Index 2.459
Algebraic Connectivity 0.031 Laplacian Largest Eigenvalue 5.578
Average Degree 1.939 Longest Induced Cycle undefined
Bipartite Yes Longest Induced Path 12
Chromatic Index 4 Matching Number 9
Chromatic Number 2 Maximum Degree 4
Circumference undefined Minimum Degree 1
Claw-Free No Minimum Dominating Set 9
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 32
Density 0.061 Number of Triangles 0
Diameter 12 Number of Vertices 33
Edge Connectivity 1 Planar Yes
Eulerian No Radius 6
Genus 0 Regular No
Girth undefined Second Largest Eigenvalue 2.277
Hamiltonian No Smallest Eigenvalue -2.459
Independence Number 24 Vertex Connectivity 1

A table row rendered like this indicates that the graph is marked as being interesting for that invariant.


Posted by Kevin Ryde at Feb 5, 2020 7:32 AM.
Heuberger and Wagner determine trees of n vertices with the most maximum matchings and show there is a unique such tree (except two each at n=6 and n=34). The present tree is n=33. It has 42823 maximum matchings (of size matchnum 9).

Clemens Heuberger and Stephan Wagner, "The Number of Maximum Matchings In a Tree", Discrete Mathematics, volume 311, issue 21, November 2011, pages 2512-2542.

You need to be logged in to be able to add comments.