k-trees, k-ctrees and line splitting graphs

Veena Mathad and Basavanagoud, B. (2012) k-trees, k-ctrees and line splitting graphs. International Journal of Applied Mathematical Research, 1 (4). 487- 492. ISSN 2227-4324

[img] Text (Full Text)
k-trees, k-ctrees and Line Splitting Graphs.pdf - Published Version
Restricted to Registered users only

Download (104kB) | Request a copy
Official URL: https://dx.doi.org/10.14419/ijamr.v1i4.348


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.

Item Type: Article
Subjects: E Mathematical Science > Mathematics
Divisions: Department of > Mathematics
Depositing User: C Swapna Library Assistant
Date Deposited: 31 Aug 2019 09:20
Last Modified: 31 Aug 2019 09:20
URI: http://eprints.uni-mysore.ac.in/id/eprint/7453

Actions (login required)

View Item View Item