34 citations · 34 across the 6 of their papers we have counts for
9 papers
Maximal Linear Arrangement is NP complete on Bipartite Graphs
Aparna Das, Jonathan Needleman
The linear arrangement of a simple graph is a bijective labeling of the vertices of to the set . The maximum linear arrangement ($\texttt{maxL…
Consecutive Cycle Sums
Jessica Marotti, Jonathan Needleman
Consider placing the numbers consecutively around an -cycle. We ask for a given , which numbers can be written as a sum of consecutive numbers on the -c…
Non-magic Hypergraphs
Benjamin Ellis, David A. Nash, Jonathan Needleman +1
This article studies a generalization of magic squares to -uniform hypergraphs. In traditional magic squares the entries come from the natural numbers. A magic labeling of the v…
On Central-Peripheral Appendage Numbers of Uniform Central Graphs
Sul-Young Choi, Jonathan Needleman
In a uniform central graph (UCG) the eccentric verticies of a central vertex is the same for all central verticies. This collection of eccentric verticies is the centered periphery…
10 Questions about Boggle Logic Puzzles
Jonathan Needleman
Boggle logic puzzles are based on the popular word game Boggle, where you are given list of words, and your goal is to recreate a Boggle board. In this paper we give an overview of…
When are finite projective planes magic?
David Nash, Jonathan Needleman
This article studies a generalization of magic squares to finite projective planes. In traditional magic squares the entries come from the natural numbers. This does not work for f…