Izvorni znanstveni članak

Note on Acyclic Structures and their Self-Returning Walks

Jan V. Knop ; Computer Centre, The University Dusseldorf, 4000 Dusseldorf, Federal Republic of Germany
Wolfgang R. Muller ; Computer Centre, The University Dusseldorf, 4000 Dusseldorf, Federal Republic of Germany
Klaus Szymanski ; Computer Centre, The University Dusseldorf, 4000 Dusseldorf, Federal Republic of Germany
Milan Randić ; Department of Mathematics and Computer Science, Drake University, Des Moines, Iowa, U.S.A.
Nenad Trinajstić ; The Rugjer Boskovic Institute, P.O.B. 1016, 41001 Zagreb, Croatia, Yugoslavia

Sažetak

All rooted trees up to 16 vertices are generated and the se1f-
returning walks for the roots are calculated. The systematic search
for isocodal vertices in the same tree or in different trees revealed
that there are isospectral trees without isocodal points, that there
non-isospectral trees with isocodal points, and that there are single
trees containing several isocodal vertices.

Ključne riječi

Hrčak ID:

194210

URI

https://hrcak.srce.hr/194210

Datum izdavanja:

1.10.1983.

Posjeta: 554 *