Graph details

Graph # 32234

Adjacency matrix

001
001
110

Adjacency list

1: 3
2: 3
3: 1 2

HoG graph id

32234

Graph name

Path-3 = Star-3

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic Yes Index 1.414
Algebraic Connectivity 1 Laplacian Largest Eigenvalue 3
Average Degree 1.333 Longest Induced Cycle undefined
Bipartite Yes Longest Induced Path 2
Chromatic Index 2 Matching Number 1
Chromatic Number 2 Maximum Degree 2
Circumference undefined Minimum Degree 1
Claw-Free Yes Minimum Dominating Set 1
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 2
Density 0.667 Number of Triangles 0
Diameter 2 Number of Vertices 3
Edge Connectivity 1 Planar Yes
Eulerian No Radius 1
Genus 0 Regular No
Girth undefined Second Largest Eigenvalue 0
Hamiltonian No Smallest Eigenvalue -1.414
Independence Number 2 Vertex Connectivity 1

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

Comments

Posted by Kevin Ryde at Nov 5, 2018 2:22 AM.
The sole free tree of n=3 vertices.

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