The bondage number of the strong product of a complete graph with a path and a special starlike tree (Q2798318): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Domination alteration sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bondage number of grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4379738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bondage numbers of extended de Bruijn and Kautz digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE BONDAGE NUMBER OF C<sub>3</sub>×C<sub>n</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bondage numbers of graphs: a survey with some comments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bondage number in complete \(t\)-partite digraphs / rank
 
Normal rank

Latest revision as of 19:17, 11 July 2024

scientific article
Language Label Description Also known as
English
The bondage number of the strong product of a complete graph with a path and a special starlike tree
scientific article

    Statements

    The bondage number of the strong product of a complete graph with a path and a special starlike tree (English)
    0 references
    0 references
    0 references
    12 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    bondage number
    0 references
    strong product of graphs
    0 references
    complete graph
    0 references
    0 references