Chromatic Number of S-Antipodal Graph.

Please use this identifier to cite or link to this item: http://13.232.72.61:8080/jspui/handle/123456789/536

Full metadata record

DC Field	Value	Language
dc.contributor.author	Prashanth, B.	-
dc.date.accessioned	2018-12-06T12:18:42Z	-
dc.date.available	2018-12-06T12:18:42Z	-
dc.date.issued	2014	-
dc.identifier.citation	Prashanth, B. (2014). Chromatic number of S-Antipodal Graph. International Journal of Modern Sciences and Engineering Technology, 1(2), 25-27.	en_US
dc.identifier.issn	2349-3755	-
dc.identifier.uri	http://13.232.72.61:8080/jspui/handle/123456789/536	-
dc.description.abstract	Chromatic number of a graph G is the minimum number of colors with which a graph can be colored properly and it is denoted by c (G). In this paper we are finding the chromatic number of S-Antipodal graph, also we discussed the chromatic number of different properties of S-Antipodal graph.	en_US
dc.language.iso	en	en_US
dc.publisher	IJMSET	en_US
dc.subject	Mathematics	en_US
dc.subject	Chromatic number	en_US
dc.subject	Diameter	en_US
dc.title	Chromatic Number of S-Antipodal Graph.	en_US
dc.type	Article	en_US
Appears in Collections:	Articles

Files in This Item:

File	Description	Size	Format
Chromatic Number of S-Antipodal Graph.pdf		139.02 kB	Adobe PDF	View/Open