Acta Informatica

, Volume 24, Issue 4, pp 447–459 | Cite as

A result on k-valent graphs and its application to a graph embedding problem

  • Paul E. Dunne
Article

Summary

It is proved that any n-vertex, k-valent undirected simple graph, G, contains a spanning tree with at least \(\frac{{{\text{(}}k - {\text{2)}}n}}{{{\text{(5}}k - {\text{8}}{\text{.5)}}}}\) leaves. As a result of this it is shown that any such graph contains an independent set, of size at least n/5k, with the property that deleting the vertices in this set and their incident edges does not disconnect G. This latter result is applied by giving an improved upper bound on the area required to embed arbitrary graphs into grid graphs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berge, C.: Graphs and Hypergraphs. Amsterdam: North-Holland 1980Google Scholar
  2. 2.
    Dunne, P.E.: Improved Upper Bounds on the Area Required to Embed Arbitrary Graphs; Theory of Computation Rep. No. 55, (unpublished internal report), Dept. of Comput. Sci., Univ. of Warwick 1983Google Scholar
  3. 3.
    Leiserson, C.: Area-efficient Graph Layouts (for VLSI), Proc. 21st IEEE Symposium on foundations of Comput. Sci., pp. 270–281 (1980)Google Scholar
  4. 4.
    Mead, C., Conway, L.: Introduction to VLSI Systems. Reading, Mass.: Addison-Wesley 1980Google Scholar
  5. 5.
    Valiant, L.G.: Universality considerations in VLSI circuits; IEEE Trans. Comput. 30, 135–140 (1981)Google Scholar

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • Paul E. Dunne
    • 1
  1. 1.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK

Personalised recommendations