Related papers: Degenerate band edges in periodic quantum graphs
In band theory of solids, degeneracies manifest themselves as point, line, and surface objects. The topological nature of band degeneracies has recently been appreciated since the recognition of gapless topological quantum phases of matter.…
A method is introduced to analyze the degeneracy properties of the band structure of a photonic crystal making use of the super cells. The band structure associated with a super cell of a photonic crystal has degeneracies at the edge of the…
We study nondegenerate flat bands at the surfaces of noncentrosymmetric topological superconductors by exact diagonalization of Bogoliubov-de Gennes Hamiltonians. We show that these states are strongly spin polarized, and acquire a chiral…
Keevash, Lenz and Mubayi developed a general criterion for hypergraph spectral extremal problems in their seminal work (SIAM J. Discrete Math., 2014). Their framework shows that extremal results on the $\alpha$-spectral radius (for $\alpha…
A well-known result of Kupitz from 1982 asserts that the maximal number of edges in a convex geometric graph (CGG) on $n$ vertices that does not contain $k+1$ pairwise disjoint edges is $kn$ (provided $n>2k$). For $k=1$ and $k=n/2-1$, the…
We prove an inequality involving the degeneracy, the cutwidth and the sparsity of graphs. It implies a quadratic lower bound on the cutwidth in terms of the degeneracy for all graphs and an improvement of it for clique-free graphs.
We study the band structure and scattering of in-plane coupled longitudinal and shear stress waves in linear layered media and observe that exceptional points (EP) appear for elastic (lossless) media, when parameterized with real-valued…
A planar orthogonal drawing {\Gamma} of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and…
Confirming a conjecture posed by Caro, it was shown by Chen and Yu that every graph $G$ with $n$ vertices and at most $2n-4$ edges has a stable cutset, which is a stable set of vertices whose removal disconnects the graph. Le and Pfender…
Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
This work deals with the micromechanical study of periodic thermo-diffusive elastic multi-layered materials, which are of interest for the fabrication of solid oxide fuel cells (SOFCs). The focus is on the dynamic regime, that is…
The edge-connectivity of a graph is the minimum number of edges whose deletion disconnects the graph. Let $\Delta(G)$ the maximum degree of a graph $G$ and let $\rho(G)$ be the spectral radius of $G$. In this article we present a lower…
We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…
A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is…
We consider Laplacians on periodic both discrete and metric equilateral graphs. Their spectrum consists of an absolutely continuous part (which is a union of non-degenerate spectral bands) and flat bands, i.e., eigenvalues of infinite…
We investigate an interesting interplay of destructive interference due to lattice geometry and band folding due to enlargement of the Brillouin zone in generating and subsequently modifying the band topology in a twisted bilayer…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
We show how arbitrary unit cells of periodic materials can be represented as graphs whose nodes represent atoms and whose weighted edges represent tunneling connections between atoms. Further, we present methods to calculate the band…
Complex periodic structures inherit spectral properties from the constituent parts of their unit cells, chiefly their spectral band gaps. Exploiting this intuitive principle, which is made precise in this work, means spectral features of…