On the Hamiltonity of Perfect Total Graphs |
Received:April 07, 1994 |
Key Words:
perfect total grahp Hamiltonity.
|
Fund Project:The project supported by the NNSF of China.GPNSF and RMNSF. |
|
Hits: 2287 |
Download times: 1074 |
Abstract: |
Let G(V,E) be a simple graph. and V(T(G))=V(G)∪E(G0. E(T(G)) = {yz|y is adjacent or incident of incident to z,yz∈V(G)∪E(G)}. Let X(H) and ω(H) be chromatic number and the munber of cliques of H. respectively. Then T(G) is called a total graph of G. G is called perfect if X(H)=ω(H) for each induced subgraph H of G. We give a necessary and suffciend condition for a perfect total graph to hamiltonian. |
Citation: |
DOI:10.3770/j.issn:1000-341X.1996.01.008 |
View Full Text View/Add Comment |