This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Axiomatic characterization of the interval function of a graph

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Mulder, H.M.
Nebesky, L. (Erasmus Econometric Institute)
Abstract

A fundamental notion in metric graph theory is that of the interval function I : V × V → 2V – {} of a (finite) connected graph G = (V,E), where I(u,v) = { w | d(u,w) + d(w,v) = d(u,v) } is the interval between u and v. An obvious question is whether I can be characterized in a nice way amongst all functions F : V × V  2V – {}. This was done in [13, 14, 16] by axioms in terms of properties of the functions F. The authors of the present paper, in the conviction that characterizing the interval function belongs to the central questions of metric graph theory, return here to this result again. In this characterization the set of axioms consists of five simple, and obviously necessary, axioms, already presented in [9], plus two more complicated axioms. The question arises whether the last two axioms are really necessary in the form given or whether simpler axioms would do the trick. This question turns out to be non-trivial. The aim of this paper is to show that these two supplementary axioms are optimal in the following sense. The functions satisfying only the five simple axioms are studied extensively. Then the obstructions are pinpointed why such functions may not be the interval function of some connected graph. It turns out that these obstructions occur precisely when either one of the supplementary axioms is not satisfied. It is also shown that each of these supplementary axioms is independent of the other six axioms. The presented way of proving the characterizing theorem (Theorem 3 here) allows us to find two new separate ``intermediate'' results (Theorems 1 and 2). In addition some new characterizations of modular and median graphs are presented. As shown in the last section the results of this paper could provide a new perspective on finite connected graphs.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://hdl.handle.net/1765/13768
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Erasmus University Rotterdam, Econometric Institute in its series Econometric Institute Report with number EI 2008-20 Revision_Date: 2009-11-06.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 10 Nov 2008
Date of revision:
Handle: RePEc:dgr:eureir:1765013768

Contact details of provider:
Web page: http://www.few.eur.nl/few

For technical questions regarding this item, or to correct its listing, contact: (Anneke Kop).

Related research
Keywords: organizing function; geometric function; interval function; geodetic betweenness; 05C75; 05C99;

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? All top Economics journals are listed on RePEc.

This page was last updated on 2009-12-16.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.