On Zero Forcing Number of Permutation Graphs

DOI10.1007/978-3-642-31770-5_6MaRDI QIDQ3167349zbMATH OpenOpenAlexFDO

Authors Eunjeong Yi

Publication date 2 November 2012

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31770-5_6

zbMATH Keywords

complete \(k\)-partite graphcyclegeneralized prismnearly complete graphpathpermutation graphzero forcing numberzero forcing set

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• The Zero Forcing Number of Graphs
• On zero forcing number of graphs and their complements
• On the zero forcing number of bijection graphs
• On graphs maximizing the zero forcing number
• Some bounds on the zero forcing number of a graph
• On extremal graphs for zero forcing number
• On the zero forcing number of some Cayley graphs
• On the zero forcing number of generalized Sierpiński graphs
• On the zero forcing number of graphs and their splitting graphs
• The zero forcing number of graphs with the matching number and the cyclomatic number

Cited in

(9)

• Complexity and computation of connected zero forcing
• Extremal k-forcing sets in oriented graphs
• Reconfiguration graphs of zero forcing sets
• On the zero forcing number of bijection graphs
• The Zero Forcing Number of Graphs
• Finitely forcible graphons and permutons
• Upper bounds on the \(k\)-forcing number of a graph
• Propagating sets in Sierpiński fractal graphs
• Zero forcing sets and bipartite circulants

This page was built for publication: On Zero Forcing Number of Permutation Graphs

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