<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>
AbstractThe d-dimensional hypercube, Hd, is the graph on 2d vertices, which correspond to the 2d d-vectors whose components are either 0 or 1, two of the vertices being adjacent when they differ in just one coordinate. The notion of Hamming graphs (denoted by Kqd) generalizes the notion of hypercubes: The vertices correspond to the qd d-vectors where the components are from the set {0,1,2,…,q-1}, and two of the vertices are adjacent if and only if the corresponding vectors differ in exactly one component. In this paper we show that the pw(Hd)=∑m=0d-1mm2 and the tw(Kqd)=θ(qd/d).
Hypercube, Hamming graph, Treewidth, Discrete Mathematics and Combinatorics, Pathwidth, Theoretical Computer Science
Hypercube, Hamming graph, Treewidth, Discrete Mathematics and Combinatorics, Pathwidth, Theoretical Computer Science
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 34 | |
popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |