Characterizations and Properties of Word-representable Graph Classes

dc.contributor.author	Srinivasan, Eshwar
dc.date.accessioned	2026-05-14T10:54:43Z
dc.date.issued	2026
dc.description	Supervisor: Ramesh, H
dc.description.abstract	A graph G with vertex set V (G) and edge set E(G) is said to be word-representable if there exists a word w over the alphabet V (G) such that, for any two distinct letters x, y ∈ V (G), the letters x and y alternate in w if and only if xy ∈ E(G).
dc.identifier.other	ROLL NO.226123005
dc.identifier.uri	https://gyan.iitg.ac.in/handle/123456789/3184
dc.language.iso	en
dc.relation.ispartofseries	TH-3990
dc.rights	https://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rights.uri	https://creativecommons.org/licenses/by-nc-sa/4.0/
dc.title	Characterizations and Properties of Word-representable Graph Classes
dc.type	Thesis