Logic circuits from zero forcing

From MaRDI portal
Publication:2003480

DOI10.1007/s11047-014-9438-5zbMath1416.94079OpenAlexW3100372201WikidataQ41964632 ScholiaQ41964632MaRDI QIDQ2003480

Yanyan Li

Publication date: 8 July 2019

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-014-9438-5



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (27)

GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITEDComputational approaches for zero forcing and related problemsk-Forcing number for Cartesian product of some graphsOn trees and unicyclic graphs with equal forcing-type numbersImproved Computational Approaches and Heuristics for Zero ForcingTotal forcing sets and zero forcing sets in treesSome properties of the closed global shadow graphs and their zero forcing numberOn the universality of the quantum approximate optimization algorithmSome bounds on the zero forcing number of a graphOn graphs maximizing the zero forcing numberThe zero forcing number of graphs with the matching number and the cyclomatic numberBounding the total forcing number of graphsZero forcing number, Grundy domination number, and their variantsOn the total forcing number of a graphZero forcing in Benzenoid networkThe zero forcing polynomial of a graphThe forcing number of graphs with given girthOn the nullity of a connected graph in terms of order and maximum degreeBounds on the connected forcing number of a graphTotal forcing versus total domination in cubic graphsComplexity and computation of connected zero forcingA short proof for a lower bound on the zero forcing numberZero forcing number of degree splitting graphs and complete degree splitting graphsNote on forcing problem of treesUnnamed ItemA computational comparison of compact MILP formulations for the zero forcing numberOn extremal graphs for zero forcing number



Cites Work


This page was built for publication: Logic circuits from zero forcing