Smallest generalized cuts and diameter-increasing sets of Johnson graphs.

MaRDI QIDQ3114972zbMATH OpenFDO

Authors Wantao Ning, Qiuli Li, Heping Zhang

Publication date 20 February 2012

zbMATH Keywords

diametergeneralized cutJohnson graphlocal cut

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• On diameter stability of the Johnson graph.
• On the girth and diameter of generalized Johnson graphs
• Minimum cutsets in hypercubes
• The super-connectivity of Johnson graphs
• The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)

Cited in

(2)

• On the girth and diameter of generalized Johnson graphs
• On diameter stability of the Johnson graph.

This page was built for publication: Smallest generalized cuts and diameter-increasing sets of Johnson graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114972)