Please use this identifier to cite or link to this item:
Title: Edge Partition of the Boolean Graph BG1(G)
Authors: Janakiraman, T. N.
Bhanumathi, M
Muthammai, S
Keywords: Boolean graph BG1(G)
Edge Partition
Issue Date: 2008
Publisher: Vidyasagar University , Midnapore , West-Bengal , India
Series/Report no.: Journal of Physical Science;Vol 12 [2008]
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.
Description: 97-107
ISSN: 0972-8791 (Print)
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.