The Existence of Diameter-Edge-Critical Graphs
MetadataShow full item record
This thesis investigates diameter-edge-critical graphs. Graphs are considered an excellent modelling tool for complex physical systems and many real world problems can be represented by graphs. An important problem that arises is that of characterizing graphs that satisfy certain properties representing the requirements of the system. The diameter of a graph is an important parameter in network design and analysis, as it provides information on the efficiency and the reliability of the network. This thesis establishes classes of diameter-edge-critical graphs that have applications in networks that arise in our high technology world.
Showing items related by title, author, creator and subject.
Lam, Bee K. (1999)A network is a system that involves movement or flow of some commodities such as goods and services. In fact any structure that is in the form of a system of components some of which interact can be considered as a network. ...
Ananchuen, Nawarat (1994)Let G be a simple connected graph on 2n vertices with a perfect matching. For 1 ≤ k ≤ n - 1, G is said to be k-extendable if for every matching M of size k in G there is a perfect matching in G containing all the edges ...
Ananchuen, Watcharaphong (1993)A graph G is said to have property P(m,n,k) if for any set of m + n distinct vertices there are at least k other vertices, each of which is adjacent to the first m vertices but not adjacent to any of the latter n vertices. ...