Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903150 | Discrete Mathematics | 2018 | 5 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Louis Anthony Agong, Carmen Amarra, John S. Caughman, Ari J. Herman, Taiyo S. Terada,