Edge domination in Boolean function graph B(Kp, L(G), NINC) of a graph

DOI10.1080/09720529.2019.1685237MaRDI QIDQ5036688zbMATH OpenOpenAlexWikidataFDO

Authors S. Muthammai, S. Dhanalakshmi

Publication date 23 February 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2019.1685237

zbMATH Keywords

corona graphsedge domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Boolean functions (06E30)

Recommendations

• Domination numbers on the Boolean function graph of a graph
• Domination numbers on the complement of the Boolean function graph of a graph
• Global domination and neighborhood numbers in Boolean function graph of a graph
• On the Boolean function graph of a graph and on its complement
• Boundary edge domination in graphs

Cites work

• P₄-Decomposition of Total Graphs
• Complementary edge domination in graphs
• Domination numbers on the Boolean function graph of a graph
• Domination numbers on the complement of the Boolean function graph of a graph
• Edge domination in graphs
• scientific article; zbMATH DE number 3674114 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Line domination in graphs
• On the Boolean function graph of a graph and on its complement
• On the VC-dimension and boolean functions with long runs

Cited in

(2)

• 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

This page was built for publication: Edge domination in Boolean function graph \(\mathrm{B}(\overline{Kp}, \mathrm{L(G), NINC})\) of a graph

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