Please use this identifier to cite or link to this item: http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/763
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJanakiraman, T. N.
dc.contributor.authorBhanumathi, M
dc.contributor.authorMuthammai, S
dc.date.accessioned2016-12-22T17:09:14Z-
dc.date.available2016-12-22T17:09:14Z-
dc.date.issued2008
dc.identifier.issn0972-8791 (Print)
dc.identifier.urihttp://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/763-
dc.description97-107en_US
dc.description.abstractLet 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.isoen_USen_US
dc.publisherVidyasagar University , Midnapore , West-Bengal , Indiaen_US
dc.relation.ispartofseriesJournal of Physical Science;Vol 12 [2008]
dc.subjectBoolean graph BG1(G)en_US
dc.subjectEdge Partitionen_US
dc.titleEdge Partition of the Boolean Graph BG1(G)en_US
dc.typeArticleen_US
Appears in Collections:Journal of Physical Sciences Vol.12 [2008]

Files in This Item:
File Description SizeFormat 
JPS12-9.pdf193.78 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.