On the Boolean function graph of a graph and on its complement

Title:

On the Boolean function graph of a graph and on its complement

Creator:

Janakiraman, T. N., Muthammai, S., and Bhanumathi, M.

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:39819e99-38fa-42c2-9d23-b46ca6568915
uuid:39819e99-38fa-42c2-9d23-b46ca6568915
doi:10.21136/MB.2005.134130

Subject:

eccentricity, self-centered graph, middle graph, and Boolean function graph

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

For any graph G, let V (G) and E(G) denote the vertex set and the edge set of G respectively. The Boolean function graph B(G, L(G), NINC) of G is a graph with vertex set V (G) ∪ E(G) and two vertices in B(G, L(G), NINC) are adjacent if and only if they correspond to two adjacent vertices of G, two adjacent edges of G or to a vertex and an edge not incident to it in G. For brevity, this graph is denoted by B1(G). In this paper, structural properties of B1(G) and its complement including traversability and eccentricity properties are studied. In addition, solutions for Boolean function graphs that are total graphs, quasi-total graphs and middle graphs are obtained.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

113-134

Source:

Mathematica bohemica | 2005 Volume:130 | Number:2

Harvested from:

CDK

Metadata only:

false