On an edge partition and root graphs of some classes of line graphs
| Main Authors: | Pravas, K; Department of Mathematics, K. K. T. M. Government College, Pullut-680663, India, Vijayakumar, A.; Department of Mathematics, Cochin University of Science and Technology, Cochin-682022, India |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2017
|
| Subjects: | |
| Online Access: |
http://www.ejgta.org/index.php/ejgta/article/view/263 http://www.ejgta.org/index.php/ejgta/article/view/263/pdf_42 |
Daftar Isi:
- The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.