PEBBLING ON THE MIDDLE GRAPH OF A COMPLETE BINARY TREE (Q5205529): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Pebbling in Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2895426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3551196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4649979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-pebbling property of the middle graph of fan graphs / rank
 
Normal rank

Latest revision as of 06:37, 21 July 2024

scientific article; zbMATH DE number 7142762
Language Label Description Also known as
English
PEBBLING ON THE MIDDLE GRAPH OF A COMPLETE BINARY TREE
scientific article; zbMATH DE number 7142762

    Statements

    0 references
    0 references
    12 December 2019
    0 references
    0 references
    \(t\)-pebbling number
    0 references
    \(2t\)-pebbling property
    0 references
    middle graph
    0 references
    complete binary tree
    0 references
    0 references
    PEBBLING ON THE MIDDLE GRAPH OF A COMPLETE BINARY TREE (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references