Bilinear and trilinear partitions of a graph

Sampathkumar, E. and Pushpalatha, L. (1994) Bilinear and trilinear partitions of a graph. INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 25 (8). pp. 843-850. ISSN 0019-5588

[img] Text (Full Text )
20005a1d_843.pdf - Published Version
Restricted to Registered users only

Download (280Kb) | Request a copy
Official URL: http://www.new.dli.ernet.in/rawdataupload/upload/i...

Abstract

Let G = (V, E) be a graph. The bilinear partition number chi(2L) (G) Of G is the minimum order of a partition L of V such that for any two sets V-i and V-j in L, the subgraph (V-i boolean OR V-j) induced by V-i boolean OR V-j is a linear forest. The trilinear partition number chi(3L) (G) Of G is the minimum order of a partition L of V such that for any three sets V-i, V-j and V-k in L, the subgraph (V-i boolean OR V-j boolean OR V-k) is a linear forest. Theorem 1 - If Delta greater than or equal to 3 is the maximum degree of G, then, 1 + [Delta/2] less than or equal to chi(2L), with equality for trees. If G is a cactus, chi(2L) less than or equal to 2 + [Delta 2]. Theorem 2 - If every block of G is complete, and omega(G) is the clique number, then chi(2L) (G) = max {omega(G), 1 + [Delta/2]}. Theorem 3 - If G is K-3-free, then 1 + Delta less than or equal to chi(3L), With equality for trees. Further, if G is a cactus, chi(3L) less than or equal to 2 + Delta.

Item Type: Article
Additional Information: Unmapped bibliographic data: DA - 1994/08// [EPrints field already has value set] LA - English [Field not mapped to EPrints]
Subjects: Physical Sciences > Mathematics
Divisions: PG Campuses > Manasagangotri, Mysore > Mathematics
Depositing User: Users 24 not found.
Date Deposited: 06 May 2013 07:48
Last Modified: 31 Aug 2013 09:00
URI: http://eprints.uni-mysore.ac.in/id/eprint/8358

Actions (login required)

View Item View Item