Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Graceful labelings -- properties and algorithms

From MaRDI portal
Publication:3172284
Jump to:navigation, search

zbMATH Open1284.05192MaRDI QIDQ3172284FDOQ3172284

Jay Bagga

Publication date: 5 October 2011





Recommendations

  • An algorithm for graceful labelings of cycles
  • Properties of graceful labelings of cycles
  • The graceful label of graphs \(C_n\) and \(1C_n\)
  • On some variants of gracefulness of cycle graphs.
  • A generating algorithm for all graceful labelings of graceful graphs


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)



Cited In (9)

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • On graceful chain graphs
  • The graceful label of graphs \(C_n\) and \(1C_n\)
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • New classes of graceful unicyclic graphs
  • Graceful and cordial labeling of subdivision of graphs
  • One curious identity counting graceful labelings





This page was built for publication: Graceful labelings -- properties and algorithms

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3172284&oldid=16418469"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 05:45. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki