<?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>06</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Vertex energy invariance in double graphs and bipartite double covers</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">15039</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.30721.2592</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Cahit</FirstName>
					<LastName>Dede</LastName>
<Affiliation>Department of Mathematics, Faculty of Science, Selçuk University,
Sel¸cuklu, 42003, Konya, Türkiye</Affiliation>
<Identifier Source="ORCID">0000-0001-5362-9513</Identifier>

</Author>
<Author>
					<FirstName>Kalpesh M.</FirstName>
					<LastName>Popat</LastName>
<Affiliation>Department of Mathematics, Saurashtra University, Rajkot, 360005, Gujarat, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>06</Month>
					<Day>15</Day>
				</PubDate>
			</History>
		<Abstract>Vertex energy is a local spectral invariant that measures the contribution of individual vertices to the overall energy of a graph. Understanding how vertex energy behaves under graph transformations is essential for both theoretical insights and practical applications in spectral graph theory and network analysis. In this paper, we investigate the preservation of vertex energy under two fundamental graph constructions: the double graph and the bipartite double cover. We prove that for any connected graph \( G \), the vertex energies of the duplicated vertices in both \( \mathrm{D}(G) \) and \( \mathrm{DC}(G) \) remain identical to those in \( G \). These results demonstrate the robustness of vertex energy as a spectral measure invariant under these duplication operations. To illustrate the theorems, we provide explicit examples and computational verifications using SAGEMATH, with code publicly available for reproducibility. Our findings contribute to the deeper understanding of spectral properties in graph operations and open avenues for further research in spectral invariants of graph transformations.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Graph energy</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Vertex Energy</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">eigenvalues</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Bipartite Double Cover</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Double Graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_15039_9086160695eeb8735766a874ce2b332a.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
