On Additive Bases and Harmonious Graphs
From MaRDI portal
Publication:3964614
DOI10.1137/0601045zbMath0499.05049OpenAlexW2126441872WikidataQ30039822 ScholiaQ30039822MaRDI QIDQ3964614
N. J. A. Sloane, Ronald L. Graham
Publication date: 1980
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1751c2265e7140239678f471df87fe4f2fdb5aef
Extremal problems in graph theory (05C35) Factorials, binomial coefficients, combinatorial functions (05A10) Graph theory (05C99) Additive bases, including sumsets (11B13)
Related Items
Group sum chromatic number of graphs, On Graceful Directed Graphs, On constructions and parameters of symmetric configurations \(v_k\), On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\), Relaxing the injectivity constraint on arithmetic and harmonious labelings, Properly even harmonious labelings of disconnected graphs, Even harmonious labelings of disjoint graphs with a small component, Harmonious graphs from α-trees, Super total graceful graphs, Some results on \(\lambda\)-valuation of graphs involving complete bipartite graphs, Perfect sumsets in finite Abelian groups, Harmonious groups, Path-sequential labellings of cycles, Bounds on the convex label number of trees, Unnamed Item, Nonabelian sets with distinct \(k\)-sums, Set-Valued Graphs: A Survey, Rainbow spanning trees in abelian groups, Sets in Abelian groups with distinct sums of pairs., The corona between cycles and paths, Path-cordial abelian groups, Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path, (Di)graph products, labelings and related results, On partitional labelings of graphs, DIVISOR CORDIAL LABELING FOR SOME SNAKES AND DEGREE SPLITTING RELATED GRAPHS, A parallel algorithm for generating ideal IC-colorings of cycles, Almost all trees are almost graceful, Unnamed Item, Embedding rainbow trees with applications to graph labelling and decomposition, Labeling constructions using digraph products, Harmonious properties of uniform \(k\)-distant trees, A rainbow blow-up lemma for almost optimally bounded edge-colourings, Sets in \(\mathbb{Z}_n\) with distinct sums of pairs., The power of digraph products applied to labelings, On the number of unlabeled vertices in edge-friendly labelings of graphs, Odd harmonious labeling of super subdivisión graphs, Odd harmonious labeling of grid graphs, Super vertex mean labeling of cycles through different ways, Unnamed Item, A-cordial graphs, On felicitous graphs, The harmonious coloring number of a graph, Exact order of subsets of asymptotic bases, Extremal bases for finite cyclic groups, Super edge magic graceful graphs, Generalized difference sets and autocorrelation integrals, Hadamard Matrices Modulo 5, Some families of $alpha$-labeled subgraphs of the integral grid, On partitional and other related graphs, Unnamed Item, On the Harmonious Coloring of Graphs, Additive edge labelings, Optimal maximal graphs, Note on the group edge irregularity strength of graphs, Unnamed Item, NEPS operations on cordial graphs, Odd harmonious labeling of some cycle related graphs, Rainbow factors in hypergraphs, Strongly edge multiplicative graphs, ODD GRACEFUL LABELINGS OF GRAPHS, A Partial Solution to Cordial Tree Conjecture, On the odd harmonious graphs with applications, Odd Harmonious Labeling of Some Classes of Graphs, On Nice (1,1) Edge-Magic Graphs, Improved lower bound for difference bases, Sequentially additive graphs, Graph theory. Abstracts from the workshop held January 6--12, 2019, Harmonious order of graphs, IC-colorings and IC-indices of graphs, On gracefully and harmoniously labeling zero-divisor graphs, Harmonious labelings of disconnected graphs involving cycles and multiple components consisting of starlike trees, All trees are six-cordial, Minimal and almost minimal perfect hash function search with application to natural language lexicon design, On a harmonious graph conjecture, Graceful labeling of triangular extension of complete bipartite graph, Productive and sum graph labelings: a survey, Group irregularity strength of connected graphs, Compatible additive permutations of finite integral bases, Graceful labeling of power graph of group Z2k−1 × Z4
Cites Work
- Two theorems on graceful trees
- Theorems in the additive theory of numbers
- Strongly graceful graphs
- On the graceful numbering of spanning trees
- N-th power residue addition sets
- Equidistant codes with distance 12
- Perfect addition sets
- Graphs, quasisymmetry and permutations with restricted positions
- Cyclic difference sets
- On generalized Langford sequences
- Ein Beitrag zur additiven Zahlentheorie
- Anwendung eines Satzes der additiven Zahlentheorie auf eine gruppentheoretische Frage
- On the Representation of 1, 2, …, n by Differences
- On the factorisation of finite abelian groups
- Note on Restricted Difference Bases
- On certain distributions of integers in pairs with given differences
- THE FACTORIZATION OF ABELIAN GROUPS
- Basen für Gitterpunktmengen.
- A Note on Steiner Triple Systems.
- On the representation of 1,2,..., n by sums
- On Langford’s Problem (I)
- Numbered complete graphs, unusual rulers, and assorted applications
- A Postage Stamp Problem
- Lower bounds for constant weight codes
- Odd Path Sums in an Edge-Labeled Tree
- Another Tree Labelling Problem
- Zu einer Vermutung von Rohrbach.
- Monthly Research Problems, 1969-75
- Bounds for binary codes of length less than 25
- Beyond the Mystic Hexagram
- The Largest Graceful Subgraph of the Complete Graph
- On Some Special Factorizations of (1-xn)/(1-x)
- Eine obere Schranke für die Reichweite einer Extremalbasis zweiter Ordnung.
- On the Cardinality of h -Bases for n
- Magic Valuations of Finite Graphs
- Notes on the Representation of 1,2, ……, N by differences
- On Langford’s Problem (II)
- A Note on Restricted Difference Bases
- Sur le problème de factorisation des groupes cycliques
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On the difference between consecutive primes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item