<?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>17</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Topological Indices and Disjoint Path Cover Property of Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>201</FirstPage>
			<LastPage>216</LastPage>
			<ELocationID EIdType="pii">115590</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2026.257594.2067</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Honggang</FirstName>
					<LastName>Zhao</LastName>
<Affiliation>College of Mathematics and System Sciences‎, ‎Xinjiang University‎, ‎Urumqi‎, 830046‎, ‎P‎. ‎R‎. ‎China</Affiliation>

</Author>
<Author>
					<FirstName>Eminjan</FirstName>
					<LastName>Sabir</LastName>
<Affiliation>College of Mathematics and System Sciences‎, ‎Xinjiang University‎, ‎Urumqi‎,
 830046‎, ‎P‎. ‎R‎. ‎China</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>09</Month>
					<Day>16</Day>
				</PubDate>
			</History>
		<Abstract>‎The disjoint path cover problem is closely related to the well-known Hamiltonian problem‎, ‎which is a fundamental concept in graph theory‎. ‎In the domains of bioinformatics and neuroinformatics‎, ‎the existence of a disjoint path cover indicates the cascade effect within the signal transduction system and the reaction occurring in a metabolic pathway‎. ‎One of the core subjects in exploring the disjoint path cover problem is to develop sufficient conditions‎. ‎In this paper‎, ‎we provide novel sufficient conditions‎, ‎with respect to some significant topological indices including Harary index‎, ‎first Zagreb index‎, ‎forgotten topological index‎, ‎reciprocal degree distance‎, ‎eccentric connectivity index‎, ‎eccentric distance sum, and connective eccentric index‎, ‎for a connected graph to be disjoint path coverable‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Hamiltonian</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Disjoint path covers</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">topological index</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_115590_603a045d62fb25e25661a3920393205c.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
