Axiomatic characterization of the center function on crown graphs

Center function identifies vertices on a graph which minimizes the maximum distance to a set of input vertices. Axiomatic approach attempts to uniquely distinguish location functions such as center, median and mean functions using a set of axioms. In this paper, an attempt is made to find an axiomatic characterization of center function on crown graphs using both universal and nonuniversal axioms.

Authors

Institutions

Publication Details

Journal
Asian-European Journal of Mathematics
Published
2025-02-21
DOI
https://doi.org/10.1142/s1793557125400042
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Axiomatic characterization of the center function on crown graphs

Jibu Thomas, Antony Mathews
Asian-European Journal of Mathematics
Advanced Graph Theory Research
article

Axiomatic characterization of the center function on crown graphs

Jibu Thomas, Antony Mathews
article en

Abstract

Center function identifies vertices on a graph which minimizes the maximum distance to a set of input vertices. Axiomatic approach attempts to uniquely distinguish location functions such as center, median and mean functions using a set of axioms. In this paper, an attempt is made to find an axiomatic characterization of center function on crown graphs using both universal and nonuniversal axioms.

Asian-European Journal of MathematicsVol. 19(02)
Assumption College (US), Berry (India) (IN)
Openalex Percentile: Top 96%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.