On the decycling number of generalized Kautz digraphs (Q477628): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C82 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6378656 / rank
 
Normal rank
Property / zbMATH Keywords
 
generalized Kautz digraph
Property / zbMATH Keywords: generalized Kautz digraph / rank
 
Normal rank
Property / zbMATH Keywords
 
interconnection networks
Property / zbMATH Keywords: interconnection networks / rank
 
Normal rank
Property / zbMATH Keywords
 
feedback vertex number
Property / zbMATH Keywords: feedback vertex number / rank
 
Normal rank
Property / zbMATH Keywords
 
decycling number
Property / zbMATH Keywords: decycling number / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063612829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decycling graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum induced trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design to Minimize Diameter on Building-Block Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Design for Directed Graphs with Minimum Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the feedback vertex set problem in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decycling hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size bounds for dynamic monopolies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local majorities, coalitions and monopolies in graphs: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets and cyclically reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets in star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal feedback vertex sets in directed split‐stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback numbers of Kautz digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3561430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback numbers of de Bruijn digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on feedback numbers of de Bruijn graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166088 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:03, 9 July 2024

scientific article
Language Label Description Also known as
English
On the decycling number of generalized Kautz digraphs
scientific article

    Statements

    On the decycling number of generalized Kautz digraphs (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    0 references
    generalized Kautz digraph
    0 references
    interconnection networks
    0 references
    feedback vertex number
    0 references
    decycling number
    0 references
    0 references