The super line graph \({\mathfrak L}_2\) (Q1304807)

A super line graph \({\mathfrak L}_r(G)\) of index \(r\) of a graph \(G= (V,E)\) is a graph whose vertices are the \(r\)-subsets of \(E\), and two vertices \(S\) and \(T\) are adjacent if there exist \(s\in S\) and \(t\in T\) such that \(s\) and \(t\) are adjacent edges in \(G\). In the present paper the graphs \({\mathfrak L}_2(G)\) are investigated. In Chapter 2 properties of \({\mathfrak L}_2(G)\) are given and at first the authors yield a general result about the order and size of \({\mathfrak L}_2(G)\) (Theorem 2.1) which is then applied to special graphs like complete and complete bipartite ones, a cycle, a path, or a hyperbuce (Theorem 2.2). Further some graph equations involving \({\mathfrak L}_2(G)\) are investigated (Theorem 2.4). Also a result on the problem of finding graphs \(G\) such that \(G\) is isomorphic to a subgraph of \({\mathfrak L}_2(G)\) is given (Proposition 2.5). Finally a sufficient condition on the maximum degree for connected \(G\) to be a subgraph of \({\mathfrak L}_2(G)\) is proved (Lemma 2.6) and a consequence of it is given in Theorem 2.7. In Chapter 3 the authors prove that for a connected graph \(G\) with \(q\geq 2\) edges the graph \({\mathfrak L}_2(G)\) is pancyclic (Theorem 3.2), and they show by an example that this theorem does not hold for disconnected graphs. In the last chapter, Chapter 4, there is given a variation of the concept of super line graph, and the super line multigraph \({\mathfrak M}_2(G)\) of index 2 of a graph \(G\) is defined: The vertices of \({\mathfrak M}_2(G)\) are pairs of edges in \(G\); for \(S= e_1e_2\) and \(T= f_1f_2\), the number of edges between \(S\) and \(T\) is the number of pairs \(e_if_j\) such that \(e_i\) and \(f_j\) are adjacent in \(G\). By figures such graphs are illustrated and by this some properties are shown and the following results are received: (1) \({\mathfrak L}_2(G)\) is a subgraph of \({\mathfrak M}_2(G)\). (2) A formula for the number of edges in terms of the degrees of vertices in \(G\) is given (Theorem 4.1). (3) A decomposition analogous to the decomposition of line graphs is described (Theorem 4.2).