Original scientific paper

On Complexity of Transitive Graphs Representing Degenerate Rearrangements

Milan Randić ; 3225 Kingman Rd., Ames, IA 50014, USA

Abstract

Graphs representing degenerate rearrangements are vertex and edge transitive. First such graph of interest in Chemistry was considered by Balaban. It describes the rearrangements of trigonal bipyramid complex XY₅ by a mechanism in which axial bonds become equatorial and three equatorial bonds become axial. We will discuss complexity of such graphs based on considering the shells of neighbors at increasing distance from a single vertex.

Keywords

transitive graphs; degenerate rearrangements; complexity index; augmented valence; monster graphs

Hrčak ID:

131920

URI

https://hrcak.srce.hr/131920

Publication date:

1.8.2001.

Visits: 1.061 *