Edge domination in Boolean function graph B(Kp, L(G), NINC) of a graph
DOI10.1080/09720529.2019.1685237zbMATH Open1495.05236OpenAlexW2994212703WikidataQ126622907 ScholiaQ126622907MaRDI QIDQ5036688FDOQ5036688
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
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Boolean functions (06E30)
Cites Work
- Title not available (Why is that?)
- Edge domination in graphs
- Title not available (Why is that?)
- Line domination in graphs
- Complementary edge domination in graphs
- P4-Decomposition of Total Graphs
- On the VC-dimension and boolean functions with long runs
- On the Boolean function graph of a graph and on its complement
- Domination numbers on the Boolean function graph of a graph
- Domination numbers on the complement of the Boolean function graph of a graph
Cited In (2)
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)