On the Boolean function graph of a graph and on its complement
From MaRDI portal
Publication:3426072
DOI10.21136/MB.2005.134130zbMath1110.05086OpenAlexW3048073080MaRDI QIDQ3426072
T. N. Janakiraman, S. Muthammai, M. Bhanumathi
Publication date: 8 March 2007
Full work available at URL: https://eudml.org/doc/32762
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
Edge domination in Boolean function graph B(L(G), NINC) of a graph ⋮ Neighbor Rupture Degree of Transformation Graphs Gxy−
This page was built for publication: On the Boolean function graph of a graph and on its complement