On middle cube graphs

@article{Dalf2015OnMC,
title={On middle cube graphs},
author={Cristina Dalf{\'o} and Miguel Angel Fiol and Margarida Mitjana},
journal={Electron. J. Graph Theory Appl.},
year={2015},
volume={3},
pages={133-145}
}
• Published 7 October 2015
• Mathematics
• Electron. J. Graph Theory Appl.
We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra…
11 Citations

Figures from this paper

Cayley properties of line graphs of consecutive layers of hypercube

Let $n >3$ and $0 1,$ if $n \neq 2k+1$, then the line graph of the graph ${Q_n}(k,k+1)$ is a vertex-transitive non Cayley graph. Also, we show that the line graph of the graph ${Q_n}(1,2)$ is a

Cayley Properties of the Line Graphs Induced by Consecutive Layers of the Hypercube

• S. Mirafzal
• Mathematics
Bulletin of the Malaysian Mathematical Sciences Society
• 2020
Let $n >3$ and $0< k < \frac{n}{2}$ be integers. In this paper, we investigate some algebraic properties of the line graph of the graph ${Q_n}(k,k+1)$ where ${Q_n}(k,k+1)$ is the subgraph of

The super-connectivity of odd graphs and of their kronecker double cover

• Mathematics
RAIRO Oper. Res.
• 2021
This work determines the minimum number of vertices that need to be deleted from a graph in order to disconnect the graph without creating isolated vertices and shows that in both instances, the super-connectivity is equal to 2k.

Spectral characterization some new classes of multicone graphs and algebraic properties of F(2.Ok) graphs.

If all the eigenvalues of the adjacency matrix of a graph $\Gamma$ are integers, then we say that $\Gamma$ is an integral graph. It seems hard to prove a graph to be determined by its spectrum. In

On 2-power unicyclic cubic graphs

• Mathematics
Electron. J. Graph Theory Appl.
• 2022
In a graph, a cycle whose length is a power of two (that is, 2 k ) is called a 2-power cycle. In this paper, we show that the existence of an infinite family of cubic graphs which contain only one

Artròpodes subterranis: novetats faunístiques i conservació en quatre espais naturals protegits de Catalunya

• Biology
Arxius de Miscel·lània Zoològica
• 2021
The description of Dicranophragma relictum Mederos (Diptera: Limoniidae) is described and new citations for Catalonia of Troglobisium racovitzai, the beetle Linderia armata (Schaufuss), and the dipterans Dactylolabis sexmaculata (Macquart) i Elliptera hungarica Madarassy.

References

SHOWING 1-10 OF 31 REFERENCES

On Twisted Odd Graphs

• Mathematics
Combinatorics, Probability and Computing
• 2000
These twisted odd graphs are examples of the so-called boundary graphs, which are graphs satisfying an extremal property that arises from a bound for the diameter of a graph in terms of its distinct eigenvalues.

Large bipartite graphs with given degree and diameter

We give constructions of bipartite graphs with maximum Δ, diameter D on B vertices, such that for every D ≥ 2 the lim infΔ∞B. Δ1-D = bD > 0. We also improve similar results on ordinary graphs, for

Eigenvalues and the diameter of graphs

• Mathematics, Computer Science
• 1995
Using eigenvalue interlacing and Chebyshev polynomials the authors find upper bounds for the diameter of regular and bipartite biregular graphs in terms of their eigenvalues, which have some applications to the covering radius of error-correcting codes.

Diameter, Covering Index, Covering Radius and Eigenvalues

• Mathematics, Computer Science
Eur. J. Comb.
• 1991

From regular boundary graphs to antipodal distance-regular graphs

• Mathematics
J. Graph Theory
• 1998
It is shown that those extremal (D = d) boundary graphs where each vertex have maximum eccentricity are, in fact, 2-antipodal distanceregular graphs.