<?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>Damghan University Press</PublisherName>
				<JournalTitle>Analytical and Numerical Solutions for Nonlinear Equations</JournalTitle>
				<Issn>3060-785X</Issn>
				<Volume>8</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>10</Month>
					<Day>22</Day>
				</PubDate>
			</Journal>
<ArticleTitle>The Maximum Edge Eccentricity Energy of a Graph</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>182</FirstPage>
			<LastPage>190</LastPage>
			<ELocationID EIdType="pii">438</ELocationID>
			
<ELocationID EIdType="doi">10.22128/gadm.2024.863.1119</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Akram Sadat </FirstName>
					<LastName>Banihashemi Dehkordi</LastName>
<Affiliation>Faculty of Mathematics, Statistics and Computer Science, Semnan University, P.O. Box: 35195--363, Semnan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Saeed </FirstName>
					<LastName>Mohammadian Semnani</LastName>
<Affiliation>Faculty of Mathematics, Statistics and Computer Science, Semnan University, P.O. Box: 35195--363, Semnan, Iran</Affiliation>
<Identifier Source="ORCID">0000-0001-6755-4911</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>08</Month>
					<Day>19</Day>
				</PubDate>
			</History>
		<Abstract>This paper presents a new concept in graph theory‎, ‎focusing on a connected graph&#039;s edge eccentricity‎. ‎We define a new matrix‎, ‎the maximum edge eccentricity matrix $M_{e_{e}}(\Upsilon)$‎, ‎which represents the maximum edge distance between all pairs of edges in the graph‎. ‎This matrix is derived from the graph&#039;s structure and the eccentricity values of its edges‎. ‎Our work explores the characteristics of this matrix‎, ‎including the determination of specific coefficients within its characteristic polynomial‎, ‎denoted as $P(\Upsilon,\nu)$‎. ‎Furthermore‎, ‎we introduce the concept of maximum edge eccentricity energy $M_{e_{e}}(\Upsilon)$ for connected graphs and provide calculations for well-known graphs‎. ‎We establish upper and lower bounds for $E_{M_{e_{e}}}(\Upsilon)$ and prove that if the maximum edge eccentricity energy of a graph is rational‎, ‎it must be an even number.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Edge distance in the graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Edge eccentricity in the graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Maximum edge eccentricity matrix</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Maximum edge eccentricity eigenvalue</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Maximum edge eccentricity energy of a graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ansne.du.ac.ir/article_438_993af8aea015cb7aa068139e9f259e5e.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
