On the mod sum number of \(H _{m,n }\)

DOI10.1007/s10878-011-9432-0zbMath1282.90211OpenAlexW2003185652MaRDI QIDQ385472

Wenqing Dou

Publication date: 2 December 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9432-0

zbMATH Keywords

graph \(H _{m,n }\)mod sum graphmod sum labellingmod sum number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Connected graphs which are not mod sum graphs
• A family of sparse graphs of large sum number
• The (mod, integral) sum numbers of fans and \(K_{n,n}-E(nK_{2})\)
• A sum labelling for the generalised friendship graph
• On the sum number of wheels
• New formula for the sum number for the complete bipartite graphs
• Bounds on the number of isolates in sum graph labeling
• The (integral) sum number of \(K_n-E(K_r)\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item