On Zero Forcing Number of Permutation Graphs

DOI10.1007/978-3-642-31770-5_6zbMath1301.05176OpenAlexW1004658788MaRDI QIDQ3167349

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

cyclepathgeneralized prismzero forcing numberzero forcing setpermutation graphcomplete \(k\)-partite graphnearly complete graph

Mathematics Subject Classification ID

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

Related Items (3)

Extremal \(k\)-forcing sets in oriented graphs ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ Complexity and computation of connected zero forcing

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