<?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>11</Month>
					<Day>15</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Simple-intersection Graphs of S-acts</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">15044</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.30632.2558</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Xingliang</FirstName>
					<LastName>Liang</LastName>
<Affiliation>Shaanxi University of Science and Technology, Xi’an, Shaanxi 710021, P.R. China</Affiliation>

</Author>
<Author>
					<FirstName>Yujie</FirstName>
					<LastName>Wang</LastName>
<Affiliation>Shaanxi University of Science and Technology, Xi’an, Shaanxi 710021, P.R. China</Affiliation>

</Author>
<Author>
					<FirstName>Xiaojie</FirstName>
					<LastName>Chen</LastName>
<Affiliation>Shaanxi University of Science and Technology, Xi’an, Shaanxi 710021, P.R. China</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>05</Month>
					<Day>18</Day>
				</PubDate>
			</History>
		<Abstract>The intersection graph of an algebraic structure plays a pivotal role in understanding and analyzing algebraic structures---such as groups, rings, modules, acts---by encoding substructural relationships into graph-theoretic frameworks. In this paper, we introduce a new intersection-graph type for an $S$-act $A$ over a semigroup $S$, termed the \emph{simple intersection graph} of $A$, denoted by $GS(A)$. We focus on the relationship between algebraic properties of $A$ and graph-theoretic characteristics of $GS(A)$, including degree, cycles, cliques, connectivity, bipartiteness and dominaning sets. Specifically, we characterize $S$-acts $A$ for which $GS(A)$ is complete, connected or complete bipartite, and determine key invariants such as degree, girth, diameter, clique number and domination number of $GS(A)$. Applications include solutions to coloring optimization problems and extensions to semigroup-based graphs $GS(S)$.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">S-act</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Simple-intersection graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">clique</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">bipartiteness</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Domination number</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_15044_093de00a3caf2a5e845f1d901725215c.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
