On the mod sum number of H m,n

Wenqing Dou ()
Additional contact information
Wenqing Dou: Shanghai Second Polytechnic University

Journal of Combinatorial Optimization, 2013, vol. 26, issue 3, No 5, 465-471

Abstract: Abstract Let N denote the set of all positive integers. The sum graph G +(S) of a finite subset S⊂N is the graph (S,E) with uv∈E if and only if u+v∈S. A graph G is said to be an mod sum graph if it is isomorphic to the sum graph of some S⊂Z M \{0} and all arithmetic performed modulo M where M≥|S|+1. The mod sum number ρ(G) of G is the smallest number of isolated vertices which when added to G result in a mod sum graph. It is known that the graphs H m,n (n>m≥3) are not mod sum graphs. In this paper we show that H m,n are not mod sum graphs for m≥3 and n≥3. Additionally, we prove that ρ(H m,3)=m for m≥3, H m,n ∪ρK 1 is exclusive for m≥3 and n≥4 and $m(n-1) \leq \rho(H_{m,n})\leq \frac{1}{2} mn(n-1)$ for m≥3 and n≥4.

Keywords: Mod sum graph; Mod sum number; Mod sum labelling; Graph H m; n (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9432-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:26:y:2013:i:3:d:10.1007_s10878-011-9432-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9432-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().