<?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>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>14</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2023</Year>
					<Month>08</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On a Conjecture on Edge Mostar Index of Bicyclic Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>97</FirstPage>
			<LastPage>108</LastPage>
			<ELocationID EIdType="pii">113866</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2023.248632.1680</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Liju</FirstName>
					<LastName>Alex</LastName>
<Affiliation>Department of Mathematics, Bishop Chulaparambil Memorial College, Kottayam-686001
&amp;
Department of Mathematics, Marthoma College, Pathanamthitta - 689103, India</Affiliation>

</Author>
<Author>
					<FirstName>Indulal</FirstName>
					<LastName>Gopalapillai</LastName>
<Affiliation>Department of Mathematics, St. Aloysius College, Edathua, Alappuzha - 689573, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>12</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract>For an edge e = uv of a graph G, mu(e|G) denotes the number of edges closer&lt;br /&gt;to the vertex u than to v (similarly mv(e|G)). The edge Mostar index Moe(G), of a graph&lt;br /&gt;G is defined as the sum of absolute differences between mu(e|G) and mv(e|G) over all&lt;br /&gt;edges e = uv of G. H. Liu et al. proposed a Conjecture on extremal bicyclic graphs with&lt;br /&gt;respect to the edge Mostar index [1]. Even though the Conjecture was true in case of the&lt;br /&gt;lower bound and proved in [2], it was wrong for the upper bound. In this paper, we&lt;br /&gt;disprove the Conjecture proposed by H. Liu et al. [1], propose its correct version and&lt;br /&gt;prove it. We also give an alternate proof for the lower bound of the edge Mostar index&lt;br /&gt;for bicyclic graphs with a given number of vertices.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">topological index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Mostar index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Edge Mostar index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Bicyclic graphs</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_113866_a4ed9d93b3ca02a832e1d847446b73c7.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
