Hamiltonian lines in the square of graphs. II
Stanislav Říha (1988)
Archivum Mathematicum
Similarity:
Stanislav Říha (1988)
Archivum Mathematicum
Similarity:
Yousef Alavi, Gary Chartrand (1975)
Czechoslovak Mathematical Journal
Similarity:
Stanislav Říha, Milan Sekanina (1983)
Archivum Mathematicum
Similarity:
T. N. Janakiraman, S. Muthammai, M. Bhanumathi (2005)
Mathematica Bohemica
Similarity:
For any graph , let and denote the vertex set and the edge set of respectively. The Boolean function graph of is a graph with vertex set and two vertices in are adjacent if and only if they correspond to two adjacent vertices of , two adjacent edges of or to a vertex and an edge not incident to it in . For brevity, this graph is denoted by . In this paper, structural properties of and its complement including traversability and eccentricity properties are studied....