Every Tree is a Subtree of a Graceful Unicyclic Graph

By: V, Murugan

A decomposition of a graph K into a set of graphs {G1, G2, ..., Gt} is a partition (E1, E2, ..., Et) of E(K) such that ∼= Gi, for i,1

• Format: Paperback
• Language: English
• ISBN: 6207809378
• ISBN13: 9786207809370
• Release Date: July 2024
• Publisher: LAP Lambert Academic Publishing
• Length: 176 Pages
• Weight: 0.59 lbs.
• Dimensions: 0.4" x 6.0" x 9.0"