scientific article; zbMATH DE number 7326221

zbMath1456.05162MaRDI QIDQ5855594

Nosratollah Shajareh Poursalavati, Maryam Tavakkoli, Saeedeh Rashidi

Publication date: 19 March 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generalized Petersen graphzero forcing numberColin de Verdière parameter

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

Related Items (2)

On the semitotal forcing number of a graph ⋮ Edge Forcing in Butterfly Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
• Minimum rank problems
• On minimum rank and zero forcing sets of a graph
• Zero forcing parameters and minimum rank problems
• Vertex domination of generalized Petersen graphs
• The classification of Hamiltonian generalized Petersen graphs
• On the crossing numbers of certain generalized Petersen graphs
• Hamiltonian cycles in generalized Petersen graphs
• Families of graphs with maximum nullity equal to zero forcing number
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Zero forcing sets and the minimum rank of graphs
• On the crossing numbers of loop networks and generalized Petersen graphs
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph

This page was built for publication: