Edge Partition of the Boolean Graph BG1(G)

Please use this identifier to cite or link to this item: https://ir.vidyasagar.ac.in/jspui/handle/123456789/763

Full metadata record

DC Field	Value	Language
dc.contributor.author	Janakiraman, T. N.
dc.contributor.author	Bhanumathi, M
dc.contributor.author	Muthammai, S
dc.date.accessioned	2016-12-22T17:09:14Z	-
dc.date.available	2016-12-22T17:09:14Z	-
dc.date.issued	2008
dc.identifier.issn	0972-8791 (Print)
dc.identifier.uri	https://ir.vidyasagar.ac.in/handle/123456789/763	-
dc.description	97-107	en_US
dc.description.abstract	Let G be a simple (p, q) graph with vertex set V(G) and edge set E(G). BG, NINC,Kq(G) is a graph with vertex set V(G) ∪ E(G) and two vertices are adjacent if and only if they correspond to two adjacent vertices of G or to a vertex and an edge not incident to it in G. For simplicity, denote this graph by BG1(G), Boolean graph of G-first kind. In this paper, partitions of edges of BG1(G) are studied.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Vidyasagar University , Midnapore , West-Bengal , India	en_US
dc.relation.ispartofseries	Journal of Physical Science;Vol 12 [2008]
dc.subject	Boolean graph BG1(G)	en_US
dc.subject	Edge Partition	en_US
dc.title	Edge Partition of the Boolean Graph BG1(G)	en_US
dc.type	Article	en_US
Appears in Collections:	Journal of Physical Sciences Vol.12 [2008]

Files in This Item:

File	Description	Size	Format
JPS12-9.pdf		193.78 kB	Adobe PDF	View/Open