Some Cayley graphs with propagation time of at most two

DOI10.22124/JART.2024.21625.1370MaRDI QIDQ6585924zbMATH OpenFDO

Authors Ebrahim Vatandoost

Publication date 12 August 2024

Published in Journal of Algebra and Related Topics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22124/JART.2024.21625.1370

zbMATH Keywords

Cayley graphpropagation timezero forcing number

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Some Cayley graphs with propagation time 1
• On the zero forcing number of some Cayley graphs
• Propagation time for zero forcing on a graph
• Connected zero forcing sets and connected propagation time of graphs
• Zero forcing propagation time on oriented graphs

Cites work

• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• An upper bound for the minimum rank of a graph
• Domination and signed domination number of Cayley graphs
• Nondiscriminatory propagation on trees
• On the zero forcing number of generalized Sierpiński graphs
• On the zero forcing number of some Cayley graphs
• Propagation time for zero forcing on a graph
• Some Cayley graphs with propagation time 1
• Some results of the minimum edge dominating energy of the Cayley graphs for the finite group \(S_n\)
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• Zero forcing sets and the minimum rank of graphs

Cited in

(2)

• Some Cayley graphs with propagation time 1
• Zero forcing number and propagation time discrepancy of some graphs

This page was built for publication: Some Cayley graphs with propagation time of at most two

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