On the graph for which there is a tree as the inverse interchange graph of a local graph
- 18 Downloads
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.
KeywordsNumber Theory Algebraic Geometry Topological Group Undirected Graph Multiple Edge
Unable to display preview. Download preview PDF.
- Berge, C.: The theory of graphs and its applications. 3rd edn, London: Methuen & Co LTD 1966.Google Scholar
- Hakimi, S.L.: On trees of a graph and their generation. J. Franklin Instit. 272, 347–359 (1961).Google Scholar
- 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
- Nieminen, J.: A note on realization of cutset matrices into graphs. International J. of Electronics 31, 415–420 (1971).Google Scholar