Reconstructing a Graph from its Arc Incidence Graph
- 93 Downloads
Introduced implicitly by Brualdi and Massey (Discret Math 122(1–3):51–58, 1993) in their work on the strong chromatic index of multigraphs, the arc incidence graph AI(G) of a graph G is defined as the square of the line graph of the incidence graph of G. We describe a linear-time algorithm for recognizing arc incidence graphs and reconstructing a graph with no isolated vertices from its arc incidence graph.
KeywordsArc incidence graph Incidence graph Incidence coloring conjecture Reconstruction Algorithm
Unable to display preview. Download preview PDF.
- 1.Java Platform Standard Edition, 6th edn. LinkedHashSet. http://download.oracle.com/javase/6/docs/api/java/util/LinkedHashSet.html
- 8.Hemminger, R.L.: Line digraphs, Graph theory and applications. In: Proceedings of the Conference at Western Michigan University, Kalamazoo, Mich., 1972; dedicated to the memory of J.W.T. Youngs. Lecture Notes in Mathematics, vol. 303, pp. 149–163. Springer, Berlin (1972)Google Scholar
- 17.Venkataraman, N., Sundareswaran, R., Swaminathan, V.: A note on incidence graphs. In: International Conference on Graph Theory and its Applications. Electronic Notes in Discrete Mathematics, vol. 33, pp. 87–93. Elsevier Science B.V., Amsterdam (2009)Google Scholar