k-trees, k-ctrees and Line Splitting Graphs
About this article
Abstract
Let G = (V,E) be a graph. For each edge ei of G, a new vertexe?i is taken and the resulting set of vertices is denoted by E1(G). Theline splitting graph Ls(G) of a graph G is defined as the graph havingvertex set E(G)SE1(G) with two vertices adjacent if they correspondto adjacent edges of G or one corresponds to an element e?i of E1(G)and the other to an element ej of E(G) where ej is in N(ei). In thispaper we characterize graphs whose line splitting graphs are k ? treesand k ? ctrees.
References
[1] F. Harary, Graph Theory, Addison Wesley, 1969.
[2] V.R.Kulli and M.S.Biradar, The line splitting graph of a graph, Acta Ciencia Indica, 28 (M.No.3) (2002), pp.317-322.
[3] D.R.Lick and A.T.White, k − degenerate graphs, C anad.J.Math., 22 (1970), pp.1082-1096.
[4] H.P.Patil, On the Structure of k − trees, J.Comb., Inform and System Sci., 11(No.2-4) (1986), pp.57-64.
[5] H.P.Patil and R.Pandiyaraj, On the structure of k−ctrees and their applications to graph valued functions, Proceedings of the National Conference on Graph Theory and Its Applications, Tumkur University, Tumkur, (Dec 5th 2011), pp.1-8.
View more references (2)
[6] H.P.Patil(Warsaw), k − trees and some graph valued functions, Discussiones Mathematicae, 7 (1985), pp.87-92.
[7] E.Sampathkumar and H.B.Walikar, On splitting graph of a graph, J.Karnatak University Sci. 25 and 26(combined) (1980-81), pp.13-16.