Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Three-state zero forcing on graphs

From MaRDI portal
Publication:2799862
Jump to:navigation, search

zbMATH Open1338.05260MaRDI QIDQ2799862FDOQ2799862


Authors: Thomas Ansill, Brian Podlisny, Daniel Saavedra, Peter Yeung, Bonnie C. Jacob Edit this on Wikidata


Publication date: 13 April 2016

Published in: Congressus Numerantium (Search for Journal in Brave)





Recommendations

  • Probalistic zero forcing in graphs
  • Maximum nullity and zero forcing number on graphs with maximum degree at most three
  • The Zero Forcing Number of Graphs
  • On graphs maximizing the zero forcing number
  • Zero forcing in triangulations
  • Zero forcing versus domination in cubic graphs
  • On extremal graphs for zero forcing number
  • On zero forcing number of graphs and their complements
  • Some bounds on the zero forcing number of a graph
  • Zero-forcing in random regular graphs


zbMATH Keywords

dynamical systems on the vertex set of a graph


Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)







This page was built for publication: Three-state zero forcing on graphs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2799862&oldid=15697667"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 17:14. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki