<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Azarbaijan Shahid Madani University</PublisherName>
				<JournalTitle>Communications in Combinatorics and Optimization</JournalTitle>
				<Issn>2538-2128</Issn>
				<Volume></Volume>
				<Issue>Articles in Press</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>09</Month>
					<Day>12</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Characterization of word-representable graphs using modular decomposition</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">15016</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.30487.2494</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Tithi</FirstName>
					<LastName>Dwary</LastName>
<Affiliation>Department of Mathematics, Indian Institute of Technology Guwahati, India</Affiliation>

</Author>
<Author>
					<FirstName>K.V.</FirstName>
					<LastName>Krishna</LastName>
<Affiliation>Department of Mathematics, Indian Institute of Technology Guwahati, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>04</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract>In this work, we characterize the class of word-representable graphs with respect to the modular decomposition. Consequently, we determine the representation number of a word-representable graph in terms of the permutation-representation numbers of the subgraphs induced by modules and the representation number of the associated quotient graph. In this context, we also obtain a complete answer to the open problem posed by Kitaev and Lozin on the word-representability of the lexicographical product of graphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Word-representable graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">representation number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">comparability graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">lexicographical product</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">modular decomposition</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_15016_2ae32486c1b1f468c57ba5b804bec162.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
