Perfect product graphs

Ravindra, G. ; Parthasarathy, K. R. (1977) Perfect product graphs Discrete Mathematics, 20 . pp. 177-186. ISSN 0012-365X

Full text not available from this repository.

Official URL: http://linkinghub.elsevier.com/retrieve/pii/001236...

Related URL: http://dx.doi.org/10.1016/0012-365X(77)90056-5

Abstract

In this paper perfectness of various products of graphs is considered. The Cartesian product G1 × G2 is perfect if it has no induced C2n+1 (n ≥ 2). By considering the various sufficient conditions for the latter condition, perfect Cartesian products are characterized. Similarly perfect tensor products G1 × G2 are characterized and it is proved that the composition G1[G2] is perfect if G1 and G2 are perfect. Perfectness of normal products was studied in an earlier paper.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:36233
Deposited On:25 May 2011 13:33
Last Modified:25 May 2011 13:33

Repository Staff Only: item control page