Old and new generalizations of line graphs

Jay Bagga

International Journal of Mathematics and Mathematical Sciences, 2004, vol. 2004, 1-13

Abstract:

Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge-isomorphism implies isomorphism except for K 3 and K 1 , 3 . The line graph transformation is one of the most widely studied of all graph transformations. In its long history, the concept has been rediscovered several times, with different names such as derived graph, interchange graph, and edge-to-vertex dual. Line graphs can also be considered as intersection graphs. Several variations and generalizations of line graphs have been proposed and studied. These include the concepts of total graphs, path graphs, and others. In this brief survey we describe these and some more recent generalizations and extensions including super line graphs and triangle graphs.

Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2004/398216.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2004/398216.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:398216

DOI: 10.1155/S0161171204310094

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().