On the distance in some bipartite graphs $L_{k,n}$
Combinatorics
2013-11-12 v1
Abstract
The paper presents some bipartite graph , so called -level graph, that arise by taking -th and -th levels of -dimensional Boolean algebra. Two results are establised: (1) precise description of a distance (a shotest path) beteen arbitrary vertices and (2) solution of the problem how many vertices may be reached in steps starting from some intial point.
Cite
@article{arxiv.1311.2294,
title = {On the distance in some bipartite graphs $L_{k,n}$},
author = {Marcin Łazarz},
journal= {arXiv preprint arXiv:1311.2294},
year = {2013}
}