Covering matrices of a graph

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	S R Jayaram	-
dc.contributor.author	Divya Rashmi, S V	-
dc.date.accessioned	2017-06-19T06:13:28Z	-
dc.date.available	2017-06-19T06:13:28Z	-
dc.date.issued	2017-06	-
dc.identifier.citation	Covering matrices of a graph	en_US
dc.identifier.issn	2231-5373	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/1/157	-
dc.description.abstract	Given a Graph G = ((V(G),E(G)), and a subset , S with a given property(covering set, Dominating set, Neighbourhood set), we define a matrix taking a row for each of the minimal set corresponding to the given property and a column for each of the vertex of G. The elements of the matrix are 1 or 0 respectively as the vertex is contained in minimal set or otherwise. That is matrix (mij) has elements mij and mij = 1 if ith row minimal set contains jth vertex = 0 otherwise This paper initiates a study on these new types of matrices of a graph and we characterize such matrices for some special classes of graphs.	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Mathematics Trends & Technology	en_US
dc.subject	Covering matrices of a graph	en_US
dc.title	Covering matrices of a graph	en_US
dc.type	Article	en_US
Appears in Collections:	1

Files in This Item:

File	Description	Size	Format
Covering matrix of a graph new.doc		468 kB	Microsoft Word	View/Open

DSpace JSPUI