Number of connected graphs on n vertices such that any two distinct vertices that are connected by at least 2 distinct paths of length 2 are also connected by an edge.
A135445
Number of connected graphs on n vertices such that any two distinct vertices that are connected by at least 2 distinct paths of length 2 are also connected by an edge.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =4a(4) =10a(5) =25a(6) =76a(7) =255a(8) =1017a(9) =4678
External references
- oeis: A135445