Published In

Discrete Mathematics

Document Type


Publication Date



Johnson graphs, Diameter (Geometry), Uniform subset graphs, Set theory


Let v > k > i be non-negative integers. The generalized Johnson graph, J(v,k,i), is the graph whose vertices are the k-subsets of a v-set, where vertices A and B are adjacent whenever |A∩B|= i. In this article, we derive general formulas for the girth and diameter of J(v,k,i). Additionally, we provide a formula for the distance between any two vertices A and B in terms of the cardinality of their intersection.


© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license

NOTICE: this is the author’s version of a work that was accepted for publication in Discrete Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Mathematics, 57, (January 2018).



Persistent Identifier

Included in

Set Theory Commons