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

DOI10.21136/MB.2005.134130MaRDI QIDQ3426072zbMATH OpenOpenAlexFDO

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

Publication date 8 March 2007

Full work available at URL https://eudml.org/doc/32762, http://mb.math.cas.cz/mb130-2/

zbMATH Keywords

eccentricitymiddle graphself-centered graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Recommendations

• Domination numbers on the complement of the Boolean function graph of a graph
• scientific article; zbMATH DE number 30977
• On the Cayley graphs of Boolean functions
• scientific article; zbMATH DE number 701114
• Domination numbers on the Boolean function graph of a graph
• On the complements of graphs
• Complement of a graph: a generalization
• scientific article; zbMATH DE number 1539538
• On the bit graph of Boolean vectors

Cited in

(7)

• Global domination and neighborhood numbers in Boolean function graph of a graph
• Domination numbers on the complement of the Boolean function graph of a graph
• Edge domination in Boolean function graph \(\mathrm{B}(\overline{Kp}, \mathrm{L(G), NINC})\) of a graph
• scientific article; zbMATH DE number 3895118 (Why is no real title available?)
• Neighbor rupture degree of transformation graphs \(G^{xy-}\)
• On metric dimension of Boolean graph BG₁(G)
• On the non-incident quasi-total graph and its complement

This page was built for publication: On the Boolean function graph of a graph and on its complement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3426072)