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

DOI10.1080/09720529.2019.1685237zbMath1495.05236OpenAlexW2994212703WikidataQ126622907 ScholiaQ126622907MaRDI QIDQ5036688

S. Muthammai, Samiappan 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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Line domination in graphs
• Complementary edge domination in graphs
• Edge domination in graphs
• 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
• On the VC-dimension and boolean functions with long runs
• P₄-Decomposition of Total Graphs

This page was built for publication: Edge domination in Boolean function graph B(L(G), NINC) of a graph