Node-graceful graphs (Q1104944): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Numbered complete graphs, unusual rulers, and assorted applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addressing Problem for Loop Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3892270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3331243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graceful Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain distributions of integers in pairs with given differences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Skolem graceful graphs / rank
 
Normal rank

Latest revision as of 17:53, 18 June 2024

scientific article
Language Label Description Also known as
English
Node-graceful graphs
scientific article

    Statements

    Node-graceful graphs (English)
    0 references
    0 references
    0 references
    1988
    0 references
    The authors generalize the well-known concept of a graceful graph by introducing the notion of a node-graceful graph. Furthermore, they give some examples of node-graceful graphs which are very interesting because they show the connection between graph theory and its applications to an expanding range of domains.
    0 references
    graceful graph
    0 references
    node-graceful graph
    0 references

    Identifiers