z-logo
open-access-imgOpen Access
Computing the zero forcing number for generalized Petersen graphs
Author(s) -
Saeedeh Rashidi,
N.S. Poursalavati,
Maryam Tavakkoli
Publication year - 2020
Publication title -
journal of algebra combinatorics discrete structures and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.137
H-Index - 1
ISSN - 2148-838X
DOI - 10.13069/jacodesmath.729465
Subject(s) - combinatorics , colored , vertex (graph theory) , mathematics , zero (linguistics) , graph , forcing (mathematics) , discrete mathematics , physics , mathematical analysis , linguistics , philosophy , materials science , composite material

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom