Izlaganje sa skupa

The Connectivity Indices of Regular Graphs

Sonja Nikolić orcid.org/0000-0003-3203-040X ; Rugjer Bošković Institute, P.O.B. 1016, HR–10001 Zagreb, Croatia
Nenad Trinajstić ; Rugjer Bošković Institute, P.O.B. 1016, HR–10001 Zagreb, Croatia
Sanja Ivaniš ; Belupo d.o.o., HR–43300 Koprivnica, Croatia

Sažetak

Explicit formulae for computing the first three vertex- and edgeconnectivity indices of regular graphs are given. Formulae for the vertex- and edge-connectivity indices for 2-regular graphs, modeling cycles, are identical because in these graphs the adjacency patterns and the numbers of vertices and edges are the same. In the case of a 3-regular graph, e.g., that of a fullerene, the zero-order and second-order vertex-connectivity indices coincide, and the first three edge-connectivity indices are identical.

Ključne riječi

connectivity indices; regular graphs; annulenes; fullerenes

Hrčak ID:

132306

URI

https://hrcak.srce.hr/132306

Datum izdavanja:

1.12.1999.

Posjeta: 682 *