Results 1-3 of 24
The graph G pictured in Fig. 1 is isomorphic to the graph H of Fig. 3; in fact, the
map 6 defined by 6(u) = a, 0(v) = d, 6(w) = f, 8(x) = b, and 0(y) = c is an
isomorphism from G onto H. Some classes of graphs occur so frequently that
special names ...
There is a good algorithm for solving the optimal assignment problem that utilizes
finding maximum matchings in a series of appropriately defined bipartite graphs.
Associated with a given assignment of jobs there is a bipartite graph.
Lo vaasz has shown that if a graph G has order n and size m with m a n(n - l)/4,
then G is edge- reconstructible. Intuitively, the edge-reconstruction conjecture is
weaker than the reconstruction conjecture. This is confirmed by Theorem 21.
What people are saying - Write a review
Encyclopedia of physical science and technologyUser Review - Not Available - Book Verdict
Although almost a decade has passed since the second edition of this work was published, this encyclopedia's reputation as a high-quality scholarly work has not diminished. Guided by an advisory board ... Read full review
Fusion Devices Explosive 1 Brij Agrawal
Game Theory 37 Glacial Geology
16 other sections not shown
Other editions - View all
Nuclear Instruments & Methods in Physics Research: Accelerators ..., Volume 271
No preview available - 1988
Laws and Models: Science, Engineering, and Technology
Carl W. Hall
Limited preview - 2018