manuscripta mathematica

, Volume 7, Issue 4, pp 331–340 | Cite as

On the graph for which there is a tree as the inverse interchange graph of a local graph

  • Juhani Nieminen


Let G be a finite, connected, undirected graph without loops and multiple edges. The note modifies slightly the concept of I−1 (Tt), the inverse interchange graph of the local graph G(Tt) defined by a reference tree t G, and considers the properties of the graph G, when I−1(Tt) is a tree.


Number Theory Algebraic Geometry Topological Group Undirected Graph Multiple Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Berge, C.: The theory of graphs and its applications. 3rd edn, London: Methuen & Co LTD 1966.Google Scholar
  2. [2]
    Hakimi, S.L.: On trees of a graph and their generation. J. Franklin Instit. 272, 347–359 (1961).Google Scholar
  3. [3]
    Kishi, G., Kajitani, Y.: Subsets of trees which determine the original graph. Electronics and communications in Japan 52, N 2, 23–30 (1969).Google Scholar
  4. [4]
    Nieminen, J.: A note on realization of cutset matrices into graphs. International J. of Electronics 31, 415–420 (1971).Google Scholar

Copyright information

© Springer-Verlag 1972

Authors and Affiliations

  • Juhani Nieminen
    • 1
  1. 1.Tampere university of technologyTampere 23Finland

Personalised recommendations