Issue 4, 541–720
Issue 3, 361–539
Issue 2, 181–360
Issue 1, 1–180
Volume 9, 5 issues
Volume 8, 5 issues
Volume 7, 6 issues
Volume 6, 4 issues
Volume 5, 4 issues
Volume 4, 4 issues
Volume 3, 4 issues
Volume 2, 5 issues
Volume 1, 2 issues
This article is available for purchase or by subscription. See below.
limited outdegree grid digraphs and greatest increase grid
Joshua Chester, Linnea Edlin, Jonah Galeota-Sprung,
Bradley Isom, Alexander Moore, Virginia Perkins, A. Malcolm
Campbell, Todd T. Eckdahl, Laurie J. Heyer and Jeffrey L.
Vol. 9 (2016), No. 2, 211–221
In this paper, we introduce two special classes of digraphs. A limited
outdegree grid (LOG) directed graph is a digraph derived from an
graph by removing some edges and replacing some edges with arcs such
that no vertex has outdegree greater than 1. A greatest increase grid (GIG)
directed graph is a LOG digraph whose vertices can be labeled with distinct
labels such that each arc represents the direction of greatest increase in the
underlying grid graph. We enumerate both GIG and LOG digraphs for the
PDF Access Denied
We have not been able to recognize your IP address 22.214.171.124
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form.
Or, visit our
for instructions on purchasing a subscription.
You may also contact us at
email@example.com or by using our contact form.
Or, you may purchase this single article for USD 9.95:
graph, directed graph, greatest increase grid graph,
limited outdegree grid graph, discrete gradient ascent,
Mathematical Subject Classification 2010
Primary: 05C20, 05C30
Published: 2 March 2016
Communicated by Ronald Gould