Quantifying topological indices in bipartite and tripartite graphs using Lyndon words and Python algorithms

Lyndon Word Representable Graphs (LWRGs) present a novel intersection between graph structures and symbolic sequences, with significant implications for chemical graph theory. This study enhances the understanding of LWRGs by deriving specific topological indices for binary and ternary core words. B...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of information technology (Singapore. Online) Jg. 17; H. 2; S. 1247 - 1258
Hauptverfasser:	Sethukkarasi, A., Vidyanandini, S., Arulprakasam, R.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Singapore Springer Nature Singapore 01.03.2025 Springer Nature B.V
Schlagworte:	Artificial Intelligence Computer Imaging Computer Science Graph theory Graphical representations Graphs Image Processing and Computer Vision Machine Learning Network analysis Original Research Pattern Recognition and Graphics Software Engineering Topology Vision Lyndon words Binary words Lyndon word representable graphs Topological indices Bipartite graphs
ISSN:	2511-2104, 2511-2112
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!