
The edge-integrity of a graph
Let
The numbers of sets of independent edge sets in
It is well-known that if
Given a set of
Suppose
Exact designs with
A tree
The edges of the tree
Median graphs are surveyed from the point of view of their characterizations, their role in location theory, and their connections with median structures. The median structures we present include ternary algebras, betweenness, interval structures, semilattices, hypergraphs, join geometries, and conflict models. In addition, some new characterizations of median graphs as meshed graphs are presented and a new characterization in terms of location theory is given.
Up to isomorphisms, there are exactly 22
Let
Scheduling graphs are used by algorithms such as PERT/CPM in order to determine an optimal schedule for a given project. It is well-known that dummy tasks (requiring zero processing time) must sometimes be incorporated into a scheduling graph.
The main tool in this paper is a new algorithm, RESOLVE, which creates a scheduling graph, typically with fewer dummy tasks than are produced by Richards’ algorithm (1967). A theoretical framework for scheduling graphs is systematically developed through several theorems, culminating in a demonstration of the validity of RESOLVE. A worked example illustrating the application of RESOLVE concludes the paper.
Let
The concept of tenacity of a graph
Particular balanced bipartite subgraph problems have applications in fields such as VLSI design and flexible manufacturing. An example of such problems is the following: given a graph
We generalize the result to particular subclasses of
Using computer algorithms, we show that in any
Blocks of type
1970-2025 CP (Manitoba, Canada) unless otherwise stated.