본문 바로가기
KERD
논문KCI 등재

k-trees and some graph operators

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

In this paper, we charactrize those graphs whose plick graphs are k-trees ; k ≤ 4 and also show that plick graphs are not k-trees; k ≥ 5. Further we also characterize those graphs whose lict graphs are k-trees ; k ≥ 2 and also establish characterization for semi-total block graph to be k-tree ; k ≥ 1 and total-block graph to be k-tree ; k ≥ 2.

Abstract

In this paper, we charactrize those graphs whose plick graphs are k-trees ; k ≤ 4 and also show that plick graphs are not k-trees; k ≥ 5. Further we also characterize those graphs whose lict graphs are k-trees ; k ≥ 2 and also establish characterization for semi-total block graph to be k-tree ; k ≥ 1 and total-block graph to be k-tree ; k ≥ 2.

참고문헌 (7)

  1. F. Harary, "Graph Theory" (1969), Addison-Wesley
  2. V. R. Kulli, "Characeterizations of planar plick graphs", Discussiones Mathematicae Graph theory, 24, pp.41~45 (2004)
  3. V. R. Kulli, "Lict and litact graph of a graph", Journal of Analysis and Computation, 2(1), pp.33~43 (2006)
  4. V. R. Kulli, "The semitotal block graph and the total block graph of a graph", Indian J. of Pure and Appl. Math, 7, pp.625~630 (1976)
  5. V. R. Kulli, "Traversability and planarity of total-block graphs", J. Math-ematical and Physical Sci, 11, pp.365~375 (1977)
  6. H. P. Patil, "k-trees and some graph valued functions", Discussiones Mathemati-cae, 7, pp.87~92 (1985)
  7. H. P. Patil, "On the structure of k-trees", Journal of Combinatorics, Information and System Sciences, 11(2-4), pp.57~64 (1986)

관련 논문AI추천

이 간행물의 다른 논문 (10건)