Displaying similar documents to “Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem”

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

T. N. Janakiraman, S. Muthammai, M. Bhanumathi (2005)

Mathematica Bohemica

Similarity:

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 ) , N I N C ) of G is a graph with vertex set V ( G ) ∪ E ( G ) and two vertices in B ( G , L ( G ) , N I N C ) 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 B 1 ( G ) . In this paper, structural properties of B 1 ( G ) and its complement including traversability and eccentricity properties are studied....