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

Full description

Saved in:
Bibliographic Details
Published in:International journal of information technology (Singapore. Online) Vol. 17; no. 2; pp. 1247 - 1258
Main Authors: Sethukkarasi, A., Vidyanandini, S., Arulprakasam, R.
Format: Journal Article
Language:English
Published: Singapore Springer Nature Singapore 01.03.2025
Springer Nature B.V
Subjects:
ISSN:2511-2104, 2511-2112
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. By linking LWRGs to topological indices, we provide new insights into the structural relationships between words and graphs. This interdisciplinary approach highlights the utility of Lyndon words in representing graph properties and underscores the relevance of topological indices in various applications, from network analysis to molecular chemistry.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2511-2104
2511-2112
DOI:10.1007/s41870-024-02303-0