New formula for the sum number for the complete bipartite graphs

DOI10.1016/S0012-365X(01)00188-1zbMath0993.05130OpenAlexW1967072319MaRDI QIDQ5946756

Artem V. Pyatkin

Publication date: 25 September 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00188-1

zbMATH Keywords

sum graphsum numbercomplete bipartite graphs

Mathematics Subject Classification ID

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

Related Items (8)

The space complexity of sum labelling ⋮ On the mod sum number of \(H _{m,n }\) ⋮ The (mod, integral) sum numbers of fans and \(K_{n,n}-E(nK_{2})\) ⋮ On the range of size of sum graphs \& integral sum graphs of a given order ⋮ A sum labelling for the generalised friendship graph ⋮ The space complexity of sum labelling ⋮ Some results on exclusive sum graphs ⋮ Minimal sum labeling of graphs

This page was built for publication: New formula for the sum number for the complete bipartite graphs