CLASSIFICATION OF COMPLETE 5-PARTITE GRAPHS AND CHROMATICITY OF 5-PARTITE GRAPHS WITH 5n + 2 VERTICES

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/3795

Full metadata record

DC Field	Value	Language
dc.contributor.author	H. ROSLAN, A. SH. AMEEN	-
dc.contributor.author	Y. H. PENG, H. X. ZHAO	-
dc.date.accessioned	2022-10-20T08:55:01Z	-
dc.date.available	2022-10-20T08:55:01Z	-
dc.date.issued	2010	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/3795	-
dc.description.abstract	Let P(G, λ) be the chromatic polynomial of a graph G. Then two graphs G and H are said to be chromatically equivalent, denoted as G ~ H, if P( )( ) G, λ = P H, λ . We write [G] = {H \| H ~ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 5-partite graphs with 2 5n + vertices according to the number of 6-independent partitions of G. Using these results, we investigate the chromaticity of G with certain star or matching deleted. As	en_US
dc.subject	chromatic polynomia	en_US
dc.subject	chromatically closed	en_US
dc.subject	chromatic uniqueness	en_US
dc.title	CLASSIFICATION OF COMPLETE 5-PARTITE GRAPHS AND CHROMATICITY OF 5-PARTITE GRAPHS WITH 5n + 2 VERTICES	en_US
dc.type	Article	en_US
Appears in Collections:	قسم الرياضيات التطبيقية

Files in This Item:

File	Description	Size	Format
CLASSIFICATION OF COMPLETE 5-PARTITE GRAPHS AND CHROMATICITY OF 5-PARTITE GRAPHS WITH 5n + 2 VERTICES.pdf		168.19 kB	Adobe PDF	View/Open