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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of information technology (Singapore. Online) Ročník 17; číslo 2; s. 1247 - 1258
Hlavní autori:	Sethukkarasi, A., Vidyanandini, S., Arulprakasam, R.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Singapore Springer Nature Singapore 01.03.2025 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!