On k-regular edge connectivity of chemical graphs

• Published in: Main group metal chemistry 2022-07, Vol.45 (1), p.106-110
• Main Authors: Ediz, Süleyman, Çiftçi, İdris
• Format: Article
• Language: English
• Subjects: almost; almost k-regular connectivity; Cartesian coordinates; chemical graph theory; conditional connectivity; connectivity; Fault tolerance; Graph theory; Graphs; k-regular edge connectivity; regular connectivity; regular edge connectivity; Topology
• ISSN: 2191-0219; 0792-1241; 2191-0219
• DOI: 10.1515/mgmc-2022-0014

Quantitative structure property research works, which are the essential part in chemical information and modelling, give basic underlying topological properties for chemical substances. This information enables conducting more feasible studies between theory and practice. Connectivity concept in chemical graph theory gives information about underlying topology of chemical structures, fault tolerance of molecules, and vulnerability of chemical networks. In this study we first defined two novel types of conditional connectivity measures based on regularity notion: -regular edge connectivity and almost -regular edge connectivity in chemical graph theory literature. We computed these new graph invariants for cycles, complete graphs, and Cartesian product of cycles. Our results will be applied to calculate -regular edge connectivity of some nanotubes which are stated as Cartesian product of cycles. These calculations give information about fault tolerance capacity and vulnerability of these chemical structures.