summary:By the interval function of a finite connected graph we mean the interval function in the sense of H. M. Mulder. This function is very important for studying properties of a finite connected graph which depend on the distance between vertices. The interval function of a finite connected graph was characterized by the present author. The interval function of an infinite connected graph can be defined similarly to that of a finite one. In the present paper we give a characterization of the interval function of each connected graph
Betweenness is a universal notion present in several disciplines of mathematics. The notion of betwe...
AbstractA graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bi...
AbstractAn interval-regular graph is a connected graph in which, for any two vertices u and v, the n...
summary:By the interval function of a finite connected graph we mean the interval function in the se...
summary:As was shown in the book of Mulder [4], the interval function is an important tool for study...
summary:The interval function (in the sense of H. M. Mulder) is an important tool for studying those...
AbstractA fundamental notion in metric graph theory is that of the interval function I:V×V→2V−{0̸} o...
textabstractA fundamental notion in metric graph theory is that of the interval function I : V × V →...
AbstractLet G be a (finite) connected graph. Intervals and steps in G are objects that depend on the...
AbstractLet V be a finite nonempty set. In this paper, a road system on V (as a generalization of th...
In this note we extend the Mulder-Nebeský characterization of the interval function of a connected g...
AbstractA simple connected graph G is said to be interval distance monotone if the interval I(u,v) b...
summary:An axiomatic characterization of the distance function of a connected graph is given in this...
AbstractWe give the construction of an infinite family of interval-regular graphs which are not inte...
summary:If $G$ is a connected graph with distance function $d$, then by a step in $G$ is meant an ...
Betweenness is a universal notion present in several disciplines of mathematics. The notion of betwe...
AbstractA graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bi...
AbstractAn interval-regular graph is a connected graph in which, for any two vertices u and v, the n...
summary:By the interval function of a finite connected graph we mean the interval function in the se...
summary:As was shown in the book of Mulder [4], the interval function is an important tool for study...
summary:The interval function (in the sense of H. M. Mulder) is an important tool for studying those...
AbstractA fundamental notion in metric graph theory is that of the interval function I:V×V→2V−{0̸} o...
textabstractA fundamental notion in metric graph theory is that of the interval function I : V × V →...
AbstractLet G be a (finite) connected graph. Intervals and steps in G are objects that depend on the...
AbstractLet V be a finite nonempty set. In this paper, a road system on V (as a generalization of th...
In this note we extend the Mulder-Nebeský characterization of the interval function of a connected g...
AbstractA simple connected graph G is said to be interval distance monotone if the interval I(u,v) b...
summary:An axiomatic characterization of the distance function of a connected graph is given in this...
AbstractWe give the construction of an infinite family of interval-regular graphs which are not inte...
summary:If $G$ is a connected graph with distance function $d$, then by a step in $G$ is meant an ...
Betweenness is a universal notion present in several disciplines of mathematics. The notion of betwe...
AbstractA graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bi...
AbstractAn interval-regular graph is a connected graph in which, for any two vertices u and v, the n...