New classes of graceful trees (Q2018958): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59048857, #quickstatements; #temporary_batch_1711486624475
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3663322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic survey of graph labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of mathematical programming in graceful labeling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sequential labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numbered complete graphs, unusual rulers, and assorted applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(G\)-decomposition of \(K_n\), where G has four vertices or less / rank
 
Normal rank

Latest revision as of 22:19, 9 July 2024

scientific article
Language Label Description Also known as
English
New classes of graceful trees
scientific article

    Statements

    New classes of graceful trees (English)
    0 references
    0 references
    0 references
    26 March 2015
    0 references
    Summary: Graceful labeling is one of the most researched problems. One of the earliest results is that caterpillars are graceful. We show that caterpillars connected to a vertex recursively satisfying certain conditions are also graceful.
    0 references
    0 references
    Graceful labeling
    0 references
    caterpillars
    0 references
    0 references
    0 references