The decycling number of generalized Petersen graphs

DOI10.1016/j.dam.2014.09.005zbMath1304.05082OpenAlexW1999238541MaRDI QIDQ479058

Dejun Zhu, Liqing Gao, Xirong Xu, Yuansheng Yang, Jian Wang

Publication date: 5 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.09.005

zbMATH Keywords

cyclesacyclic subgraphgeneralized Petersen graphsdecycling numberdecycling set

Mathematics Subject Classification ID

Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (11)

New formulae for the decycling number of graphs ⋮ A new formula for the decycling number of regular graphs ⋮ Domination number and feedback vertex number of complements of line graphs ⋮ Strong edge chromatic index of the generalized Petersen graphs ⋮ The strong metric dimension of some generalized Petersen graphs ⋮ Acyclic polynomials of graphs ⋮ New formulae for the bipartite vertex frustration and decycling number of graphs ⋮ Acyclic sum-list-colouring of grids and other classes of graphs ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles ⋮ Cycle intersection graphs and minimum decycling sets of even graphs ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Feedback vertex set in hypercubes
• On the bounds of feedback numbers of \((n,k)\)-star graphs
• Feedback vertex sets in star graphs
• Maximum induced trees in graphs
• Decycling graphs
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• Reducibility among Combinatorial Problems

This page was built for publication: The decycling number of generalized Petersen graphs