Edge Forcing in Butterfly Networks

DOI10.3233/FI-2021-2074OpenAlexW3216383911MaRDI QIDQ5025049

Sujana G. Jessy, Rajan R. Sundara, T. M. Rajalaxmi, Indra Rajasingh

Publication date: 1 February 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.04764

zbMATH Keywords

independent setbutterfly networkszero forcing setforced vertexedge-forcing set

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Propagation time for zero forcing on a graph
• Zero forcing number, path cover number, and maximum nullity of cacti
• On the total forcing number of a graph
• Bounds on the connected forcing number of a graph
• On the zero forcing number and propagation time of oriented graphs
• Minimum rank and zero forcing number for butterfly networks
• Zero forcing sets and the minimum rank of graphs
• The Zero Forcing Number of Graphs
• Power domination in honeycomb networks
• Domination in Graphs Applied to Electric Power Networks
• On the zero forcing number of generalized Sierpinski graphs
• Bounds for the Zero Forcing Number of Graphs with Large Girth
• On the complexity of the positive semidefinite zero forcing number

This page was built for publication: Edge Forcing in Butterfly Networks