Generalized Johnson Graphs: Structure & Metrics

• Generalized Johnson graphs are defined on the k-subsets of an n-set with edges formed by prescribed intersection sizes, generalizing classical Johnson and Kneser graphs.
• Their metric properties, such as girth, odd girth, distance and diameter, are determined by a key parameter Δ, providing clear algebraic and combinatorial insights.
• Extensions to geometric island graphs, full-flag analogues, and q-analogues demonstrate their versatility in studying symmetry, connectivity, and zero forcing phenomena.

to=arxiv_search.search เติมเงินไทยฟรี 70 200 {"query":"generalized Johnson graph (Caughman et al., 2023) girth odd girth distance diameter", "max_results": 10} to=arxiv_search.search 彩神争霸代理 70 200 {"query":"The girth, odd girth, distance function, and diameter of generalized Johnson graphs", "max_results": 5} to=arxiv_search.search ,一本道 70 200 {"query":"merged Johnson graphs distinguishing number (Kim et al., 2011)", "max_results": 5} to=arxiv_search.search 】【。】【”】【70 200 {"query":"zero blocking numbers generalized Johnson graphs (Lin et al., 4 Aug 2025)", "max_results": 5} to=arxiv_search.search 】【。】【”】【70 200 {"query":"On the diameter and zero forcing number of some graph classes in the Johnson Grassmann and Hamming association scheme generalized Johnson graphs (Abiad et al., 2023)", "max_results": 5} to=arxiv_search.search 】【。】【”】【70 200 {"query":"Properties of Full-Flag Johnson Graphs (Dai et al., 2013)", "max_results": 5} to=arxiv_search.search 】【。】【”】【70 200 {"query":"On the Connectedness and Diameter of a Geometric Johnson Graph (Bautista-Santiago et al., 2012)", "max_results": 5} Generalized Johnson graphs are intersection graphs on uniform set systems in which vertices are $k$-subsets of an $n$-element ground set and adjacency is controlled by prescribed intersection cardinalities. In the exact-intersection form, the graph is denoted $J(v,k,i)$, $J(n,k,a)$, or $GJ(n,k,l)$, with two vertices adjacent exactly when their intersection has size $i$, $a$, or $l$, respectively. This framework contains the classical Johnson graph at parameter $k-1$ and the Kneser graph at parameter $0$, and it extends naturally to multi-intersection graphs $n$0, geometric island graphs $n$1, and full-flag analogues on permutations (Caughman et al., 2023, Abiad et al., 2023, Bautista-Santiago et al., 2012, Dai et al., 2013).

1. Definitions, notation, and principal families

The basic exact-intersection model fixes integers with $n$2 or $n$3, takes vertex set $n$4, and joins distinct $n$5-subsets $n$6 when $n$7 or $n$8. In this sense, the notation varies across the literature, but the underlying object is the same single-intersection graph. The most common specializations are the Johnson graph, obtained when the required intersection is $n$9, and the Kneser graph, obtained when the required intersection is $J(v,k,i)$0 (Caughman et al., 2023, Lin et al., 4 Aug 2025, Bautista-Santiago et al., 2012).

A broader form replaces a single allowed intersection size by a set $J(v,k,i)$1. The graph $J(v,k,i)$2 has the same vertex set $J(v,k,i)$3 and adjacency condition $J(v,k,i)$4. This includes the usual Johnson graph when $J(v,k,i)$5, the Kneser graph when $J(v,k,i)$6, and the “generalized Kneser graph” $J(v,k,i)$7 when all intersections up to $J(v,k,i)$8 are allowed (Abiad et al., 2023).

A recurrent source of terminological ambiguity is that several non-equivalent objects are also described as generalized Johnson graphs. The geometric model $J(v,k,i)$9 replaces all $J(n,k,a)$0-subsets by $J(n,k,a)$1-islands of a planar point set $J(n,k,a)$2, while Full-Flag Johnson graphs $J(n,k,a)$3 replace subsets by full flags, equivalently by permutations of $J(n,k,a)$4. These are genuine extensions of the Johnson paradigm, but they are structurally different from the exact-intersection graphs on $J(n,k,a)$5 (Bautista-Santiago et al., 2012, Dai et al., 2013).

Family	Vertex set	Adjacency rule
$J(n,k,a)$6, $J(n,k,a)$7, $J(n,k,a)$8	$J(n,k,a)$9-subsets of $GJ(n,k,l)$0	$GJ(n,k,l)$1
$GJ(n,k,l)$2	$GJ(n,k,l)$3-subsets of $GJ(n,k,l)$4	$GJ(n,k,l)$5
$GJ(n,k,l)$6	$GJ(n,k,l)$7-islands of $GJ(n,k,l)$8	$GJ(n,k,l)$9
$i$0	permutations of $i$1	exactly $i$2 initial segments differ

Within the exact-intersection theory, it is standard to assume $i$3 and $i$4, and to set

$i$5

The parameter $i$6 governs how much an intersection can grow or shrink in one step, and it organizes the formulas for girth, odd girth, distance, and diameter (Caughman et al., 2023).

2. Metric structure of $i$7

For $i$8 under the assumptions $i$9, $a$0, and $a$1, the girth is

$a$2

The triangle threshold is exact: a $a$3-cycle exists precisely when adjacent $a$4-subsets admit a common neighbor, which reduces to the inequality $a$5. Outside the two exceptional odd-graph cases, a $a$6-cycle can be built explicitly; the remaining exceptions are the classical odd graphs $a$7, with girth $a$8, and the small Kneser case $a$9, with girth $l$0 (Caughman et al., 2023).

The odd girth has a uniform closed form: $l$1 The lower bound comes from analyzing an odd cycle of length $l$2 through a vertex at distance $l$3 from two adjacent vertices, and the matching upper bound is obtained by constructing a closed walk of that length with carefully prescribed pairwise intersections. This shows that the odd-girth problem is completely controlled by the ratio $l$4 (Caughman et al., 2023).

The distance between two vertices depends only on $l$5. The exact distance formula is

$l$6

For $l$7, the issue is whether $l$8 and $l$9 have a common neighbor; if not, paths are built by replacing up to $k-1$0 elements in steps of size $k-1$1. For $k-1$2, there is a two-way competition between decreasing the intersection from $k-1$3 to $k-1$4 in $k-1$5-steps and increasing it from $k-1$6 toward $k-1$7 in $k-1$8-steps, giving the two quantities inside the minimum (Caughman et al., 2023).

The diameter is then

$k-1$9

This recovers the known Kneser-graph diameter $0$0 when $0$1, and the Johnson-graph diameter $0$2 when $0$3. A plausible implication is that $0$4 functions as the effective local step size for the entire metric theory of exact-intersection generalized Johnson graphs (Caughman et al., 2023).

3. Connectivity and diameter beyond the exact metric formulas

For the classical exact-intersection graph $0$5, connectedness is governed by a simple threshold: $0$6 If $0$7, there exist $0$8-sets with intersection smaller than $0$9, and no walk with successive intersections exactly $n$00 can join them. If $n$01, an exchange argument replaces elements of $n$02 by elements of $n$03 in batches of size $n$04, always maintaining overlap $n$05 (Bautista-Santiago et al., 2012).

Under connectedness, the classical diameter admits the bound

$n$06

hence

$n$07

For $n$08, one has

$n$09

while the special cases recover $n$10 and $n$11 for $n$12 (Bautista-Santiago et al., 2012).

The geometric variant $n$13 substantially changes the picture. Here $n$14 is a planar point set in general position, a $n$15-island is a $n$16-subset realized as $n$17 for some convex set $n$18, and two islands are adjacent when their intersection has size $n$19. When $n$20 is in convex position, every $n$21-subset is an island, so $n$22. For arbitrary $n$23, however, connectedness may require the stronger condition

$n$24

Under that hypothesis,

$n$25

If $n$26 and

$n$27

then the upper bound improves to

$n$28

At the same time, Horton-set constructions yield the lower bound

$n$29

These results show that the geometric restriction from all $n$30-subsets to convexly realizable $n$31-subsets can raise both connectivity thresholds and diameter growth rates (Bautista-Santiago et al., 2012).

4. Symmetry, automorphisms, and distinguishing colorings

The notation $n$32 is used for a graph with vertex set $n$33 and adjacency

$n$34

Thus $n$35 and $n$36. In this formulation, merged Johnson graphs sit on the same vertex set as generalized Johnson graphs and recover the classical Johnson and Kneser graphs as extremal instances (Kim et al., 2011).

The principal invariant studied in this setting is the distinguishing number $n$37, the least number of vertex-colors for which the only color-preserving automorphism is the identity. A complete piecewise determination is given for $n$38. The proof strategy combines orbital-graph analysis of automorphism groups, determining sets, asymmetric induced subgraphs, and in one family a probabilistic coloring argument. The automorphism group is $n$39 in most cases, with exceptional families involving $n$40, $n$41, or $n$42 (Kim et al., 2011).

The generic outcome is $n$43-distinguishability. The key mechanism is that one can exhibit a small induced subgraph $n$44 which is asymmetric and yet is a determining set for $n$45; then the Albertson–Collins theorem yields $n$46, and since the graph is not asymmetric, the value is $n$47. Exceptional balanced cases require more colors. In particular, when $n$48 and $n$49, the graph is a perfect matching of size $n$50, and a counting argument on equipartitions yields

$n$51

The examples $n$52 with distinguishing number $n$53 and $n$54 with distinguishing number $n$55 illustrate the difference between small exceptional parameters and the generic regime (Kim et al., 2011).

This line of work places generalized Johnson-type graphs within algebraic graph theory as highly symmetric but not uniformly rigid objects. A plausible implication is that the symmetry-breaking problem is controlled less by local degree than by exceptional automorphism enlargements at balanced parameters.

5. Zero forcing, failed forcing, and zero blocking

Zero forcing on a graph $n$56 begins with a black-white coloring of $n$57 and applies the rule: if a black vertex has exactly one white neighbor, that neighbor becomes black. A zero forcing set is an initial black set that eventually turns every vertex black; its minimum size is the zero forcing number $n$58. A failed zero forcing set is an initial black set for which the process stalls before all vertices become black; the maximum size of such a set is $n$59. The complement of a failed zero forcing set is a zero blocking set, and its minimum size is the zero blocking number $n$60, with

$n$61

These parameters have been studied for generalized Johnson graphs in both the multi-intersection and single-intersection settings (Lin et al., 4 Aug 2025, Abiad et al., 2023).

For $n$62 with $n$63 and $n$64, an explicit construction gives a connected zero forcing set of size

$n$65

so

$n$66

When $n$67, equality holds throughout. In the “$n$68” case $n$69 with $n$70, one obtains the exact value

$n$71

Setting $n$72 recovers the known formula for the Johnson graph,

$n$73

The proofs use a Bollobás-type intersection lemma and Z–Grundy bounds (Abiad et al., 2023).

For the exact-intersection graph $n$74, the zero blocking number behaves differently. If $n$75, then the graph is edgeless and $n$76. If $n$77 with $n$78, or $n$79, or $n$80, then the graph has twins and $n$81. In all other cases with $n$82 and $n$83, the graph has no isolated vertices and no twins, so $n$84 (Lin et al., 4 Aug 2025).

There is also a universal upper bound: $n$85 For sufficiently large $n$86, this is exact. Writing $n$87, one has

$n$88

More explicitly, if $n$89 and

$n$90

then

$n$91

while if $n$92 and

$n$93

then

$n$94

The significance of these results is not merely combinatorial: zero forcing connects to maximum nullity and minimum rank, while zero blocking measures how effectively one can defeat the forcing process (Lin et al., 4 Aug 2025).

6. Full-flag and $n$95-analogues

Full-Flag Johnson graphs $n$96 replace $n$97-subsets by full flags $n$98 with $n$99, equivalently by permutations $J(v,k,i)$00 of $J(v,k,i)$01 via $J(v,k,i)$02. Two vertices $J(v,k,i)$03 are adjacent precisely when exactly $J(v,k,i)$04 of the initial-segment sets differ; equivalently,

$J(v,k,i)$05

The special cases are $J(v,k,i)$06, the isolated graph, and $J(v,k,i)$07, exactly the permutahedron (Dai et al., 2013).

These graphs admit a Cayley-graph description: $J(v,k,i)$08 where $J(v,k,i)$09 consists of all permutations whose permutation matrix is $J(v,k,i)$10-block diagonal, equivalently decomposes into exactly $J(v,k,i)$11 irreducible blocks along the diagonal. For $J(v,k,i)$12, the generating set is the neighboring transpositions; for $J(v,k,i)$13, it is all irreducible permutations, and the diameter is $J(v,k,i)$14. The adjacency matrix also has a recursive block structure: after ordering vertices by inserting $J(v,k,i)$15 in each possible position, $J(v,k,i)$16 decomposes into $J(v,k,i)$17 blocks, with zero blocks when $J(v,k,i)$18, corner diagonal blocks equal to $J(v,k,i)$19, and $J(v,k,i)$20 blocks equal to $J(v,k,i)$21 (Dai et al., 2013).

For the permutahedron $J(v,k,i)$22, this block structure yields an $J(v,k,i)$23 regularity matrix $J(v,k,i)$24 whose eigenvalues form a subset of those of $J(v,k,i)$25. The example

$J(v,k,i)$26

and

$J(v,k,i)$27

illustrates the partial spectral information accessible from the recursive construction (Dai et al., 2013).

A different extension moves from sets to subspaces. The generalized Grassmann graph $J(v,k,i)$28 has as vertices the $J(v,k,i)$29-dimensional subspaces of $J(v,k,i)$30, with adjacency determined by $J(v,k,i)$31. If $J(v,k,i)$32 and $J(v,k,i)$33, then

$J(v,k,i)$34

and if $J(v,k,i)$35, then $J(v,k,i)$36. For $J(v,k,i)$37 and $J(v,k,i)$38, zero-forcing formulas parallel the set-system case with Gaussian binomial coefficients replacing ordinary binomial coefficients. This places generalized Johnson-type graphs inside a wider Johnson–Grassmann–Hamming association-scheme framework (Abiad et al., 2023).

Across these variants, the common principle is that adjacency is defined by controlled overlap—cardinality for sets, dimension for subspaces, convex realizability for islands, and rank-by-rank agreement for full flags. This suggests that generalized Johnson graph theory is best viewed not as a single graph family, but as a cluster of intersection-type and overlap-type models whose algebraic, metric, and propagation properties can often be studied by the same counting and exchange methods.