On the bounds of feedback numbers of \((n,k)\)-star graphs (Q436576): 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: 05C30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6059690 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / zbMATH Keywords
 
feedback set
Property / zbMATH Keywords: feedback set / rank
 
Normal rank
Property / zbMATH Keywords
 
feedback number
Property / zbMATH Keywords: feedback number / rank
 
Normal rank
Property / zbMATH Keywords
 
\((n
Property / zbMATH Keywords: \((n / rank
 
Normal rank
Property / zbMATH Keywords
 
k)\)-star graphs
Property / zbMATH Keywords: k)\)-star graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
cycles
Property / zbMATH Keywords: cycles / rank
 
Normal rank
Property / zbMATH Keywords
 
acyclic subgraph
Property / zbMATH Keywords: acyclic subgraph / rank
 
Normal rank
Property / zbMATH Keywords
 
networks
Property / zbMATH Keywords: networks / 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.2012.03.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117454844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((n,k)\)-star graph: A generalized star graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets in star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Application of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5173696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on feedback numbers of de Bruijn graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:36, 5 July 2024

scientific article
Language Label Description Also known as
English
On the bounds of feedback numbers of \((n,k)\)-star graphs
scientific article

    Statements

    On the bounds of feedback numbers of \((n,k)\)-star graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 July 2012
    0 references
    combinatorial problems
    0 references
    feedback set
    0 references
    feedback number
    0 references
    \((n
    0 references
    k)\)-star graphs
    0 references
    cycles
    0 references
    acyclic subgraph
    0 references
    networks
    0 references

    Identifiers