engleski

On numerical characterization of cyclicity

We propose characterizing of the cyclicity of molecular graphs by considering their D/DD matrix. Each non-diagonal element of D/DD is a quotient of the corresponding elements of the distance matrix D and the detour matrix DD of a graph. In particular, we are using the leading eigenvalue of the D/DD matrix as a descriptor of cyclicity and are investigating for monocyclic graphs C_n how this eigenvalue depends on the number of vertices n, as n approaches infinity.

molecular graph; cyclicity; distance matrix; detour matrix

nije evidentirano