<?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>07</Month>
					<Day>08</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On Distance Induced Seidel Matrices for Signed Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">14983</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.30248.2382</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Biju</FirstName>
					<LastName>K</LastName>

						<AffiliationInfo>
						<Affiliation>Department of Mathematics, P R N S S College, Mattannur, Kannur, Kerala, India</Affiliation>
						</AffiliationInfo>

						<AffiliationInfo>
						<Affiliation>Research Scholar, Dr. Hermann Gundert Central Library and Research Centre,
Kannur University, Kerala, India</Affiliation>
						</AffiliationInfo>

</Author>
<Author>
					<FirstName>Shahul Hameed</FirstName>
					<LastName>Koombail</LastName>
<Affiliation>Principal(Retired), Government Arts and Science College, Uduma, Kasaragod 671318</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>06</Day>
				</PubDate>
			</History>
		<Abstract>A signed graph $\Sigma=(G,\sigma)$ is a graph $G$ together with a signature function $\sigma$ which assigns $1$ or $-1$ on the edges of $G$. Seidel matrix of an unsigned graph is already defined and researchers investigated some of its spectral and other properties. Considering the recently introduced notion of signed distance in signed graphs and that of the distance compatible signed graphs, we define distance induced Seidel matrices for such signed graphs and analyze their spectrum mainly for some classes of unbalanced distance compatible signed graphs, as balanced signed graphs possess the same distance induced Seidel spectrum as that of its underlying graph. We also deal with the distance compatibility issue in the line graph of a distance compatible signed graph and discuss the corresponding distance induced Seidel spectrum in this regard.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Signed graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Distance compatibility</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Adjacency matrix</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Vertex-edge orientation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Line graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_14983_b9fb4a9c361c75db1107ba35454eb4ca.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
