Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation

DOI10.1016/J.ENDM.2015.05.013MaRDI QIDQ324919zbMATH OpenOpenAlexFDO

Authors Amruth Sandhupatla, Sasthi C. Ghosh

Publication date 17 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.05.013

zbMATH Keywords

complete bipartite graphfrequency allocationgraceful labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Better bounds for incremental frequency allocation in bipartite graphs
• Better bounds for incremental frequency allocation in bipartite graphs
• Exploration of gracefulness of some complete bipartite graphs
• scientific article; zbMATH DE number 1214933
• scientific article; zbMATH DE number 5942941
• scientific article; zbMATH DE number 3863228
• Discrete load balancing on complete bipartite graphs
• Schensted algorithms for dual graded graphs
• New parameters for studying graceful properties of graphs
• A construction of k-graceful graphs from complete bipartite graphs

Cites work

• scientific article; zbMATH DE number 3458691 (Why is no real title available?)
• Some new families of E-cordial graphs
• The degree distribution of the generalized duplication model

This page was built for publication: Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation

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