1. Dspace@NITW
  2. Journal Papers
  3. Electronics and Communications Engineering
Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2427
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSandhupatla, Amruth-
dc.contributor.authorGhosh, Sasthi C.-
dc.date.accessioned2025-01-06T05:15:12Z-
dc.date.available2025-01-06T05:15:12Z-
dc.date.issued2015-
dc.identifier.citation10.1016/j.endm.2015.05.013en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2427-
dc.descriptionNITWen_US
dc.description.abstractWe consider the vertex duplicated complete bipartite graph G(VA,VB)which is formed by duplicating all the vertices of a complete bipartite graph G(A,B). We then deal with the gracefulness of G(VA,VB) by considering both static and incremental frequency allocation to it. We have proved that the graceful labeling of G(VA,VB) is possible only for the case of static frequency allocation but not for the incremental frequency allocation. Finally we have shown that graceful labeling of G(A,B) satisfying certain additional properties can be extended to a σ-labeling of G(VA,VB) for the incremental frequency allocation.en_US
dc.language.isoenen_US
dc.publisherElectronic Notes in Discrete Mathematicsen_US
dc.subjectGraceful labelingen_US
dc.subjectFrequency allocationen_US
dc.titleGracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocationen_US
dc.typeArticleen_US
Appears in Collections:Electronics and Communications Engineering

Files in This Item:
File Description SizeFormat 
1-s2.0-S1571065315000141-main.pdf167.44 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.