Path (or cycle)-trees with Graph Equations involving Line and Split Graphs

  • H P Patil Pondicherry University
  • V Raja Pondicherry University

Abstract

H-trees generalizes the existing notions of trees, higher dimensional trees and k-ctrees. The characterizations and properties of both Pk-trees for k at least 4 and Cn-trees for n at least 5 and their hamiltonian property, dominations, planarity, chromatic and b-chromatic numbers are established. The conditions under which Pk-trees for k at least 3 (resp. Cn-trees for n at least 4), are the line graphs are determined. The relationship between path-trees and split graphs are developed.

##submission.authorBiography##

##submission.authorWithAffiliation##

Research Scholar

Published
2017-05-10
How to Cite
PATIL, H P; RAJA, V. Path (or cycle)-trees with Graph Equations involving Line and Split Graphs. Mapana Journal of Sciences, [S.l.], v. 16, n. 3, p. 1-12, may 2017. ISSN 0975-3303. Available at: <http://journals.christuniversity.in/index.php/mapana/article/view/1005>. Date accessed: 11 dec. 2017. doi: https://doi.org/10.12723/mjs.42.1.
Section
Research Articles