Graceful and Cordial Labeling Of Subdivision Of Graphs
- 9 September 2016
- journal article
- research article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 53, 123-131
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- One edge union of shell graphs and one vertex union of complete bipartite graphs are cordialDiscrete Mathematics, 2002
- Graceful numbering of an edge-gluing of shell graphsDiscrete Mathematics, 2000
- Cycles with a chord are gracefulJournal of Graph Theory, 1980
- Applications of numbered undirected graphsProceedings of the IEEE, 1977