Graceful and cordial labeling of subdivision of graphs
From MaRDI portal
Publication:327634
DOI10.1016/J.ENDM.2016.05.011zbMATH Open1347.05217OpenAlexW2515054647MaRDI QIDQ327634FDOQ327634
Authors: K. Sankar, G. Sethuraman
Publication date: 19 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.011
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- A dynamic survey of graph labeling
- Title not available (Why is that?)
- Subdivision of ladders are graceful
- One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial
- Graceful numbering of an edge-gluing of shell graphs
- Cycles with a chord are graceful
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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)