Induced subgraphs of Johnson graphs

DOI10.2140/involve.2012.5.25zbMath1246.05048arXiv1008.0595OpenAlexW3099093673MaRDI QIDQ444598

Ramin Naimi, Jeffrey Shaw

Publication date: 15 August 2012

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.0595

zbMATH Keywords

Johnson graphdistance graphinduced subgraphs of Johnson graphsJIS: intersection graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

On the ensemble of optimal identifying codes in a twin-free graph ⋮ Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs ⋮ On the structure of \(S_2\)-ifications of complete local rings ⋮ Which graphs occur as \(\gamma\)-graphs? ⋮ On the ensemble of optimal dominating and locating-dominating codes in a graph

This page was built for publication: Induced subgraphs of Johnson graphs