Feedback arc number and feedback vertex number of Cartesian product of directed cycles

DOI10.1155/2019/7028573zbMATH Open1453.05088OpenAlexW2996006212WikidataQ126561153 ScholiaQ126561153MaRDI QIDQ2296552FDOQ2296552

Authors: Yanyan Li 

Publication date: 18 February 2020

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/7028573

Recommendations

• On cyclic vertex-connectivity of Cartesian product digraphs
• Feedback numbers of Kautz digraphs
• Cyclic arc-connectivity in a Cartesian product digraph
• On domination number of Cartesian product of directed cycles
• Feedback numbers of de Bruijn digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Reducibility among Combinatorial Problems
• Local majorities, coalitions and monopolies in graphs: A review
• Primal-dual approximation algorithms for feedback problems in planar graphs
• Feedback Vertex Sets in Tournaments
• On the feedback vertex set problem in permutation graphs
• A linear-time algorithm for the weighted feedback vertex problem on interval graphs
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Size bounds for dynamic monopolies
• Feedback vertex sets and cyclically reducible graphs
• Feedback vertex sets on restricted bipartite graphs
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
• Decycling graphs
• Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
• Domination number of Cartesian products of directed cycles
• On the domination of Cartesian product of directed cycles: results for certain equivalence classes of lengths
• Approximating minimum feedback sets and multicuts in directed graphs
• An approximation algorithm for feedback vertex sets in tournaments
• An efficient algorithm for minimum feedback vertex sets in rotator graphs
• Title not available (Why is that?)
• Decycling Cartesian Products of Two Cycles
• The decycling number of outerplanar graphs
• On the decycling number of generalized Kautz digraphs
• The decycling number of generalized Petersen graphs
• Title not available (Why is that?)
• The minimum feedback arc set problem and the acyclic disconnection for graphs
• Independent feedback vertex sets for graphs of bounded diameter
• When the cartesian product of directed cycles is Hamiltonian
• Feedback vertex sets in cubic multigraphs
• A quadratic vertex kernel for feedback arc set in bipartite tournaments
• Decycling cubes and grids
• Title not available (Why is that?)
• On decomposition of the Cartesian product of directed cycles into cycles of equal lengths
• The decycling number and maximum genus of cubic graphs
• On the domination number of Cartesian product of two directed cycles
• A new formula for the decycling number of regular graphs
• Decycling with a matching
• On total domination number of Cartesian product of directed cycles.
• Improved bounds for minimal feedback vertex sets in tournaments

Cited In (1)

• Cyclic arc-connectivity in a Cartesian product digraph

This page was built for publication: Feedback arc number and feedback vertex number of Cartesian product of directed cycles

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