Related papers: Bandwidth and pathwidth of three-dimensional grids
Let $n,k,b$ be integers with $1 \le k-1 \le b \le n$ and let $G_{n,k,b}$ be the graph whose vertices are the $k$-element subsets $X$ of $\{0,\dots,n\}$ with $\max(X)-\min(X) \le b$ and where two such vertices $X,Y$ are joined by an edge if…
In numerous graph signal processing applications, data is often missing for a variety of reasons, and predicting the missing data is essential. In this paper, we consider data on graphs modeled as bandlimited graph signals. Predicting or…
The metric dimension of a graph measures how uniquely vertices may be identified using a set of landmark vertices. This concept is frequently used in the study of network architecture, location-based problems and communication. Given a…
We compute the treewidth of a family of graphs we refer to as the glued grids, consisting of the stacked prism graphs and the toroidal grids. Our main technique is constructing strict brambles of large orders. We discuss connections to…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize…
Getting a labeling of vertices close to the structure of the graph has been proved to be of interest in many applications e.g., to follow smooth signals indexed by the vertices of the network. This question can be related to a graph…
Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…
In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…
In this paper, we introduce a graph structure called linear dependence graph of a finite dimensional vector space over a finite field. Some basic properties of the graph like connectedness, completeness, planarity, clique number, chromatic…
The approximate computation of twin-width has attracted significant attention already since the moment the parameter was introduced. A recently proposed approach (STACS 2024) towards obtaining a better understanding of this question is to…
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…
Treewidth is an important structural graph parameter that quantifies how closely a graph resembles a tree-like structure. It has applications in many algorithmic and combinatorial problems. In this paper, we study the treewidth of outer…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…
In this paper, we give a lower bound for the maximum and minimum genus of a multibranched surface by the first Betti number and the minimum and maximum genus of the boundary of the neighborhood of it, respectively. As its application, we…
In multipath systems, available degrees of freedom can be considered as a key performance indicator, since the channel capacity grows linearly with the available degrees of freedom. However, a fundamental question arises: given a size…
We study the topological configurations of the lines of principal curvature, the asymptotic and characteristic curves on a cuspidal edge, in the domain of a parametrization of this surface as well as on the surface itself. Such…
Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph $G$ into node-disjoint subgraphs, where each subgraph has sufficiently large…
It is known that complete multipartite graphs are determined by their distance spectrum but not by their adjacency spectrum. The Seidel spectrum of a graph $G$ on more than one vertex does not determine the graph, since any graph obtained…
This survey gives a brief overview of theoretically and practically relevant algorithms to compute geodesic paths and distances on three-dimensional surfaces. The survey focuses on polyhedral three-dimensional surfaces.