<?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>14</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Hierarchy of Subfamilies of Ptolemaic Graphs: Axiomatic Characterizations and Interval Functions</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">14948</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.30144.2335</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Abdultamim</FirstName>
					<LastName>Ahadi</LastName>
<Affiliation>Department of Mathematics, University of Kerala, Thiruvananthapuram, Kerala, India</Affiliation>

</Author>
<Author>
					<FirstName>Arun</FirstName>
					<LastName>Anil</LastName>
<Affiliation>Department of Futures Studies, University of Kerala, Thiruvananthapuram, Kerala, India</Affiliation>

</Author>
<Author>
					<FirstName>Manoj</FirstName>
					<LastName>Changat</LastName>
<Affiliation>Department of Futures Studies, University of Kerala, Thiruvananthapuram, Kerala, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>11</Month>
					<Day>13</Day>
				</PubDate>
			</History>
		<Abstract>Ptolemaic graphs are precisely the graphs that are both chordal and distance-hereditary. Markenzon et al.~\cite{markenzon} established a hierarchy of Ptolemaic graphs comprising six subfamilies: laminar chordal graphs, block duplicate graphs, block graphs, AC graphs, trees, and paths. In this paper, we present a new proof of the characterization of AC graphs using forbidden induced subgraphs and identify an additional graph class that lies between AC graphs and paths within this hierarchy. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;The interval function is a well-studied tool in metric graph theory, and the characterization of the interval function of graph families is an interesting problem in metric graph theory having connections to first-order logic. In this paper, we propose a set of independent betweenness axioms for an arbitrary function known as a transit function and provide a characterization of the interval functions corresponding to graphs in the extended hierarchy of subgraphs of Ptolemaic graphs, specifically laminar chordal graphs, block duplicate graphs, and AC graphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Ptolemaic graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">laminar chordal</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">AC graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">transit function</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Interval function</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_14948_bfa39cec20b409f6e91dcfb642900eff.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
