<?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>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Characterizations of Additively Graceful Signed Paths and Cycles</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">14941</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.30365.2436</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Brian</FirstName>
					<LastName>D'Souza</LastName>
<Affiliation>School of Physical and Applied Sciences, Goa University, Taleigao Plateau, Goa 403206, India</Affiliation>

</Author>
<Author>
					<FirstName>Jessica</FirstName>
					<LastName>Pereira</LastName>
<Affiliation>School of Physical and Applied Sciences, Goa University, Taleigao Plateau, Goa 403206, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>02</Month>
					<Day>18</Day>
				</PubDate>
			</History>
		<Abstract>A $(p,m,n)$ signed graph $S$, is a signed graph of order $p$ with $m$ positive edges and $n$ negative edges. In this paper, we first prove a few basic results on vertex labelings of paths. We use these results and a sequence of lemmas to obtain a characterization of additively graceful signed paths. We prove that, apart from exactly 4 exceptions, additively graceful signed paths are characterized by the signed paths containing at most one negative section with $n \leq 2$. We also establish a characterization of additively graceful signed cycles. We prove that a $(p,m,n)$ signed cycle $S$ is additively graceful if and only if one among the following 4 conditions are satisfied, (a) $n=0$ and $ m\equiv 0$ or $3 \pmod 4$,  (b) $n=1$ and $ m\equiv 1$ or $2 \pmod 4$,  (c) $n=2$, $ m\equiv 1$ or $2 \pmod 4$ and $S$ contains a single negative section,  (d) $S$ is the all negative signed cycle on $C_3$.&lt;br /&gt; </Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">additively graceful signed graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Signed graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">graph labeling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">cycle</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">path</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_14941_80ee96a6fd90fedcca3108dda98d3ac9.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
