The interchange graph of a finite graph

  title={The interchange graph of a finite graph},
  author={Arnoud van Rooij and Herbert S. Wilf},
  journal={Acta Mathematica Academiae Scientiarum Hungarica},
  • A. V. Rooij, H. Wilf
  • Published 1965
  • Mathematics
  • Acta Mathematica Academiae Scientiarum Hungarica
Let G be a finite graph. The interchange graph G' of G, has a vertex corresponding to each edge of G, two vertices of G' being connected if the corresponding edges of G have a common vertex in G. In reference [1], the questions are raised of when G' can be isomorphic to G, and how to describe the sequence of iterated interchange graphs of a given G. We suppose that G has no loops and no multiple edges. The local degree of a vertex a of a graph G is Q (a), the number of edges of G emanating from… Expand
Minimal line graphs
In this paper all graphs will be ordinary graphs, i.e. finite, undirected, and without loops or multiple edges. For points x and y of a graph G , we shall indicate that x is adjacent to y by writingExpand
A common generalization of line graphs and clique graphs
Both the line graph and the clique graph are defined as intersection graphs of certain families of complete subgraphs of a graph, and the following three problems are investigated for k-edge graphs. Expand
Intersection Graphs of k-uniform Linear Hypergraphs
It is proved that there is a finite family F of graphs such that any graph G with minimum degree at least 69 is the intersection graph of a 3-uniform linear hypergraph if and only if G has no induced subgraph isomorphic to a member of F . Expand
Strictly Deza line graphs
For a given graph G, its line graph L(G) is defined as the graph with vertex set equal to the edge set of G in which two vertices are adjacent if and only if the corresponding edges of G have exactlyExpand
On interchange graphs
I(G) = G. This paper solves this problem for finite connected graphs with loops and parallel edges, extending earlier work on the problem. A loop (an edge whose two ends coincide in a single vertex)Expand
Iteratedk-line graphs
In this paper the iterated behavior of thek-line graph operator is investigated and it turns out that the behavior is quite different fork = 2 (the well-known line graph case),k = 3, and k≥4. Expand
Matching cutsets in graphs
It is proved that every connected graph with maximum degree ⩽3 and on more than 7 points has a matching cutset and line graphs with a matchingcutset can be recognized in O(|E|) time. Expand
On maximal independent sets of vertices in claw-free graphs
  • G. Minty
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1980
Given a finite claw-free graph with real numbers assigned to the vertices, this work exhibits an algorithm for producing an independent set of vertices of maximum total weight, which is “efficient” in the sense of J. Edmonds. Expand
A Dynamic Algorithm for Line Graph Recognition
This work presents a new dynamic solution to the problem of finding G for a given L, where one can add or delete a node v in L(G) in time proportional to the size of its adjacency list. Expand
Characterization of classical graph classes by weighted clique graphs
Several classical graph classes are characterized in terms of their weighted clique graphs, providing a common framework for describing some different well-known classes of graphs, as hereditary clique-Helly graphs, split graphs, chordal graphs, interval graphs, proper interval graph graphs, line graphs, among others. Expand