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

On pathos block line cut-vertex graph of a tree

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

A pathos block line cut-vertex graph of a tree T, written P BLc(T), is a graph whose vertices are the blocks, cut-vertices, and paths of a pathos of T, with two vertices of P BLc(T) adjacent whenever the corresponding blocks of T have a vertex in common or the edge lies on the corresponding path of the pathos or one corresponds to a block Bi of T and the other corresponds to a cut-vertex cj of T such that cj is in Bi; two distinct pathos vertices Pm and Pn of P BLc(T) are adjacent whenever the corresponding paths of the pathos Pm(vi, vj ) and Pn(vk, vl) have a common vertex. We study the properties of P BLc(T) and present the characterization of graphs whose P BLc(T) are planar; outerplanar; maximal outerplanar; minimally nonouterplanar; eulerian; and hamiltonian. We further show that for any tree T, the crossing number of P BLc(T) can never be one.

Abstract

A pathos block line cut-vertex graph of a tree T, written P BLc(T), is a graph whose vertices are the blocks, cut-vertices, and paths of a pathos of T, with two vertices of P BLc(T) adjacent whenever the corresponding blocks of T have a vertex in common or the edge lies on the corresponding path of the pathos or one corresponds to a block Bi of T and the other corresponds to a cut-vertex cj of T such that cj is in Bi; two distinct pathos vertices Pm and Pn of P BLc(T) are adjacent whenever the corresponding paths of the pathos Pm(vi, vj ) and Pn(vk, vl) have a common vertex. We study the properties of P BLc(T) and present the characterization of graphs whose P BLc(T) are planar; outerplanar; maximal outerplanar; minimally nonouterplanar; eulerian; and hamiltonian. We further show that for any tree T, the crossing number of P BLc(T) can never be one.

참고문헌 (7)

  1. F. Harary, "Graph Theory" (1969), Addison-Wesley Publishing Co.
  2. F. Harary, "Covering and packing in graphs. I", Ann. New York Acad. Sci, 175, pp.198~205 (1970)
  3. F. Harary, "The block-cutpoint-tree of a graph", Publ. Math. Debrecen, 13, pp.103~107 (1966)
  4. V. R. Kulli, "On minimally nonouterplanar graphs", Proc. Indian Nat. Sci. Acad. Part A, 41(3), pp.275~280 (1975)
  5. V. R. Kulli, "A characterization of paths", Math. Ed, 9, pp.A1~A2 (1975)
  6. V. R. Kulli, "On lict and litact graph of a graph", Proceeding of the Indian National Science Academy, 41, pp.275~280 (1975)
  7. M. H. Muddebihal, "On pathos line graph of a tree", Nat. Acad. Sci. Lett, 24(5-12), pp.116~123 (2001)

관련 논문AI추천

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