Displaying similar documents to “A Note on the Interval Function of a Disconnected Graph”

A characterization of the interval function of a (finite or infinite) connected graph

Ladislav Nebeský (2001)

Czechoslovak Mathematical Journal

Similarity:

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...

Route systems of a connected graph

Ladislav Nebeský (1994)

Mathematica Bohemica

Similarity:

The concept of a route system was introduced by the present author in [3].Route systems of a connected graph G generalize the set of all shortest paths in G . In this paper some properties of route systems are studied.

On the Maximum and Minimum Sizes of a Graph with Givenk-Connectivity

Yuefang Sun (2017)

Discussiones Mathematicae Graph Theory

Similarity:

The concept of k-connectivity κk(G), introduced by Chartrand in 1984, is a generalization of the cut-version of the classical connectivity. For an integer k ≥ 2, the k-connectivity of a connected graph G with order n ≥ k is the smallest number of vertices whose removal from G produces a graph with at least k components or a graph with fewer than k vertices. In this paper, we get a sharp upper bound for the size of G with κk(G) = t, where 1 ≤ t ≤ n − k and k ≥ 3; moreover, the unique...