Graceful and cordial labeling of subdivision of graphs
From MaRDI portal
(Redirected from Publication:327634)
Recommendations
- Degree splitting graph on graceful, felicitous and elegant labeling
- Revisiting graceful labelings of graphs
- Cordial labeling and arbitrary super subdivision of some graphs
- Nearly graceful labelings of graphs
- On gracefully and harmoniously labeling zero-divisor graphs
- scientific article; zbMATH DE number 5543086
- A note on graceful labelings and graph decomposition
- scientific article; zbMATH DE number 94970
- Cordial labeling of degree splitting graphs
- Graceful labelings -- properties and algorithms
Cites work
- scientific article; zbMATH DE number 3775580 (Why is no real title available?)
- scientific article; zbMATH DE number 3781227 (Why is no real title available?)
- scientific article; zbMATH DE number 3997850 (Why is no real title available?)
- scientific article; zbMATH DE number 2188472 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- A dynamic survey of graph labeling
- Cycles with a chord are graceful
- Graceful numbering of an edge-gluing of shell graphs
- One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial
- Subdivision of ladders are graceful
Cited in
(8)- Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
- On graceful and cordial labeling of shell graphs
- Some algebraic properties of the subdivision graph of a graph
- Some cordial graphs in the context of barycentric subdivision
- Subdivided shell flower graphs: \(\rho\)-labeling
- Disjoint union of two \(\mathrm{SSG}(2)\) is odd graceful
- Gracefull arbitrary supersubdivisions of graphs
- Quotient-3 cordial labeling for path related graphs. II
This page was built for publication: Graceful and cordial labeling of subdivision of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327634)
