Gracefully cultivating trees on a cycle

DOI10.1016/J.ENDM.2015.05.020zbMATH Open1347.05183OpenAlexW768407415MaRDI QIDQ324938FDOQ324938

Authors: Ramon M. Figueroa-Centeno, Rikio Ichishima, Akito Oshima, F. A. Muntaner-Batle 

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.020

Recommendations

• Generating graceful unicyclic graph from a given graceful tree.
• Generating graceful unicyclic graph from a given graceful tree.
• New results on graceful unicyclic graphs.
• A survey and a new class of graceful unicylic graphs
• A survey of graceful trees

zbMATH Keywords

unicyclic graphsgraceful labellingsTruszczyński conjecture

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• New families of graphs that have \(\alpha\)-labelings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Labeling the vertex amalgamation of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Generating graceful unicyclic graph from a given graceful tree.
• On the embedding of cone graphs in the line with distinct distances between neighbors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating graceful unicyclic graphs from a given forest
• Alpha graphs with different pendent paths
• The graphs \(C_7^{(t)}\) are graceful for \(t\equiv 0,1 \pmod {4}\).
• Generating graceful unicyclic graph from a given graceful tree.
• A survey and a new class of graceful unicylic graphs

This page was built for publication: Gracefully cultivating trees on a cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324938)