k-trees, k-ctrees and Line Splitting Graphs
DOI:
https://doi.org/10.14419/ijamr.v1i4.348Published:
2012-09-01Abstract
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.
View Full Article:
License
Authors who publish with this journal agree to the following terms:
                          [1]           Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
                          [2]           Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
                          [3]           Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).