Graceful and cordial labeling of subdivision of graphs (Q327634): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3960885 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4724671 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5461579 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cycles with a chord are graceful / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A dynamic survey of graph labeling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subdivision of ladders are graceful / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3955393 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5589124 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graceful numbering of an edge-gluing of shell graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial / rank | |||
Normal rank |
Latest revision as of 17:59, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graceful and cordial labeling of subdivision of graphs |
scientific article |
Statements
Graceful and cordial labeling of subdivision of graphs (English)
0 references
19 October 2016
0 references
graph labeling
0 references
graceful labeling
0 references
cordial labeling
0 references
subdivision of graphs
0 references