login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A193217 Number of non-Wiener index-unique simple connected graphs on n nodes. 0

%I #11 Jan 04 2024 19:11:54

%S 0,0,0,2,16,108,847,11110,261072

%N Number of non-Wiener index-unique simple connected graphs on n nodes.

%C The paw graph and square graph C_4 on 4 have common Wiener index 8, while all other connected simple graphs on 4 nodes have unique Wiener indices, so a(4) = 2.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WienerIndex.html">Wiener Index</a>

%K nonn,hard,more

%O 1,4

%A _Eric W. Weisstein_, Jul 18 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 22 02:43 EDT 2024. Contains 374479 sequences. (Running on oeis4.)