English
Related papers

Related papers: The Kirchhoff Index of Enhanced Hypercubes

200 papers

The Birkhoff polytope $\Omega_n$ is the polytope of doubly stochastic matrices of order $n$. The Birkhoff polytope graph $G(\Omega_n)$ is the skeleton of $\Omega_n$; it is the Cayley graph whose vertex set consists of the elements of the…

Combinatorics · Mathematics 2026-01-13 Zejun Huang , Chi-Kwong Li , Eric Swartz , Nung-Sing Sze

First we consider families in the hypercube $Q_n$ with bounded VC dimension. Frankl raised the problem of estimating the number $m(n,k)$ of maximal families of VC dimension $k$. Alon, Moran and Yehudayoff showed that…

Combinatorics · Mathematics 2017-10-25 Jozsef Balogh , Tamas Meszaros , Adam Zsolt Wagner

Spectrum graph theory not only facilitate comprehensively reflect the topological structure and dynamic characteristics of networks, but also offer significant and noteworthy applications in theoretical chemistry, network science and other…

Combinatorics · Mathematics 2022-05-04 Jia-Bao Liu , Lu-Lu Fang , Qian Zheng , Xin-Bei Peng

Let $Q$ be an ideal (downward-closed set) in the lattice of linear subspaces of $(\mathbb F_q)^n$, ordered by inclusion. For $0 \le k \le n$, let $\mu_k(Q)$ denote the fraction of $k$-dimensional subspaces that belong to $Q$. We show that…

Combinatorics · Mathematics 2019-10-03 Benjamin Rossman

We find closed form formulas for the Kemeny's constant and the Kirchhoff index for the cluster $G_1\{G_2\}$ of two highly symmetric graphs $G_1$, $G_2$, in terms of the parameters of the original graphs. We also discuss some necessary…

Probability · Mathematics 2020-07-23 Jose Palacios , Greg Markowsky

Reliability assessment of interconnection networks is critical to the design and maintenance of multiprocessor systems. The $(n, k)$-enhanced hypercube $Q_{n,k}$, as a variation of the hypercube $Q_{n}$, was proposed by Tzeng and Wei in…

Combinatorics · Mathematics 2025-10-29 Yali Sun , Mingzu Zhang , Xing Feng , Xing Yang

For positive integers $n$ and $k$ with $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph with vertex set consisting of all $k$-sets of $\{1,\dots,n\}$, where two $k$-sets are adjacent exactly when they are disjoint. The independent sets…

Combinatorics · Mathematics 2022-06-08 József Balogh , Robert A. Krueger , Haoran Luo

For an interconnection network $G$, the {\it $\omega$-wide diameter} $d_\omega(G)$ is the least $\ell$ such that any two vertices are joined by $\omega$ internally-disjoint paths of length at most $\ell$, and the {\it $(\omega-1)$-fault…

Discrete Mathematics · Computer Science 2016-06-21 Meijie Ma , Douglas B. West , Jun-Ming Xu

The generalized $q$-Kneser graph $K_q(n,k,t)$ for integers $k>t>0$ and $n>2k-t$ is the graph whose vertices are the $k$-dimensional subspaces of an $n$-dimensional $F_q$-vectorspace with two vertices $U_1$ and $U_2$ adjacent if and only if…

Combinatorics · Mathematics 2024-05-21 Klaus Metsch

Alon and Krivelevich proved that for every $n$-vertex subcubic graph $H$ and every integer $q \ge 2$ there exists a (smallest) integer $f=f(H,q)$ such that every $K_f$-minor contains a subdivision of $H$ in which the length of every…

Combinatorics · Mathematics 2021-11-11 Shagnik Das , Nemanja Draganić , Raphael Steiner

For two real bases $q_0, q_1 > 1$, we consider expansions of real numbers of the form $\sum_{k=1}^{\infty} i_k/(q_{i_1}q_{i_2}\cdots q_{i_k})$ with $i_k \in \{0,1\}$, which we call $(q_0,q_1)$-expansions. A sequence $(i_k)$ is called a…

Number Theory · Mathematics 2024-03-20 Vilmos Komornik , Wolfgang Steiner , Yuru Zou

The augmented cube $AQ_n$, proposed by Choudum and Sunitha [S. A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2) (2002) 71-84], is a $(2n-1)$-regular $(2n-1)$-connected graph $(n\ge 4)$. This paper determines that the 2-extra…

Combinatorics · Mathematics 2012-04-20 Meijie Ma , Yaxing Song , Jun-Ming Xu

The Kirchhoff index of graphs, introduced by Klein and Randi\'{c} in 1993, has been known useful in the study of computer science, complex network and quantum chemistry. The Kirchhoff index of a graph $G$ is defined as…

Combinatorics · Mathematics 2022-10-13 Hechao Liu , Lihua You

We prove a general upper bound on the $k$-th adjacency eigenvalue of a graph. For $k\ge 2$, we show that \[ \lambda_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1 \] for every graph $G$ on $n$ vertices. We build on a recent approach that…

Combinatorics · Mathematics 2026-03-31 Varun Sivashankar

Given a hyperplane $H$ cutting a compact, convex body $K$ of positive Lebesgue measure through its centroid, Gr\"unbaum proved that $$\frac{|K\cap H^+|}{|K|}\geq \left(\frac{n}{n+1}\right)^n,$$ where $H^+$ is a half-space of boundary $H$.…

Metric Geometry · Mathematics 2025-07-16 Luca Tanganelli Castrillón

A \emph{chain} in the unit $n$-cube is a set $C\subset [0,1]^n$ such that for every $\mathbf{x}=(x_1,\ldots,x_n)$ and $\mathbf{y}=(y_1,\ldots,y_n)$ in $C$ we either have $x_i\le y_i$ for all $i\in [n]$, or $x_i\ge y_i$ for all $i\in [n]$.…

Classical Analysis and ODEs · Mathematics 2019-08-14 Christos Pelekis , Václav Vlasák

Let $K/k$ be a finite Galois extension of global function fields. Let $E$ be a Drinfeld module over $k$. We state and prove an equivariant refinement of Taelman's analogue of the analytic class number formula for $(E,K/k)$, and derive…

We develop a graphical representation of polynomial invariants of unitary gauge groups, and use it to find the algebraic curve corresponding to a hyperkahler quotient of a linear space. We apply this method to four dimensional ALE spaces,…

High Energy Physics - Theory · Physics 2009-10-31 Ulf Lindstrom , Martin Rocek , Rikard von Unge

In this paper we demonstrate a calculation to find the genus of the hypercube graph $Q_n$ using real moment-angle complex $\mathcal{Z}_\mathcal{K}(D^1,S^0)$ where $\mathcal{K}$ is the boundary of an $n$-gon. We also calculate an upper bound…

Algebraic Topology · Mathematics 2020-07-26 Shouman Das

Write $K^{(k)}_{n}$ for the complete $k$-graph on $n$ vertices. For $2 \leq k \leq g < r$ integers, let $\pi\left(n, K^{(k)}_{g}, K^{(k)}_r\right)$ be the maximum density of $K^{(k)}_{g}$ in $n$ vertex $K^{(k)}_{r}$-free $k$-graphs. The…

Combinatorics · Mathematics 2023-02-20 Levente Bodnar