Related papers: On Flattenability of Graphs

For any finite, simple graph $G = (V,E)$, its $2$-distance graph $G_2$ is a graph having the same vertex set $V$ where two vertices are adjacent if and only if their distance is $2$ in $G$. Connectivity and diameter properties of these…

Starting from the working hypothesis that both physics and the corresponding mathematics have to be described by means of discrete concepts on the Planck-scale, one of the many problems one has to face in this enterprise is to find the…

Proposed as a general framework, Liu and Yu(Discrete Math. 231 (2001) 311-320) introduced $(n,k,d)$-graphs to unify the concepts of deficiency of matchings, $n$-factor-criticality and $k$-extendability. Let $G$ be a graph and let $n,k$ and…

Whiteley \cite{wh} gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined graphs, a family of graphs that contain the complete…

This paper presents a spectral framework for quantifying the differentiation between graph data samples by introducing a novel metric named Graph Geodesic Distance (GGD). For two different graphs with the same number of nodes, our framework…

Let f be a function mapping an n dimensional vector space over GF(p) to GF(p). When p is 2, Bernasconi et al. have shown that there is a correspondence between certain properties of f (e.g., if it is bent) and properties of its associated…

Through detailed analysis of scores of publicly available data sets corresponding to a wide range of large-scale networks, from communication and road networks to various forms of social networks, we explore a little-studied geometric…

Let $K_d$ be the complete metric graph on $d$ vertices. We compute the gonality of graphs obtained from $K_d$ by omitting edges forming a $K_h$, or general configurations of at most $d-2$ edges. We also investigate if these graphs can be…

We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let $\Gamma$ be a graph with vertex set $V$, diameter $D$, adjacency matrix $A$, and…

The concept of generalized $k$-connectivity $\kappa_{k}(G)$ of a graph $G$ was introduced by Chartrand et al. in recent years. In our early paper, extremal theory for this graph parameter was started. We determined the minimal number of…

The distance matrix $\mathcal{D}(G)$ of a graph $G$ is the matrix containing the pairwise distances between vertices. The transmission of a vertex $v_i$ in $G$ is the sum of the distances from $v_i$ to all other vertices and $T(G)$ is the…

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance…

Let $G$ be a graph with $n$ vertices, and $d$ be a target dimension. In this paper we study the set of rank $n-d-1$ matrices that are equilibrium stress matrices for at least one (unspecified) $d$-dimensional framework of $G$ in general…

The irregularity strength of a graph $G$, $s(G)$, is the least $k$ admitting a $\{1,2,\ldots,k\}$-weighting of the edges of $G$ assuring distinct weighted degrees of all vertices, or equivalently the least possible maximal edge multiplicity…

Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include…

Let $A \in \{ \mathbb{Z}, \mathbb{R} \}$ and $X \subset \mathbb{R}^d$ be a bounded set. Affine transformations given by an automorphism of $\mathbb{Z}^d$ and a translation in $A^d$ are called (affine) $A$-unimodular transformations. The…

Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they…

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…

The normalized distance Laplacian matrix $\mathcal{D}^{\mathcal{L}}(G)$ of a graph $G$ is a natural generalization of the normalized Laplacian matrix, arising from the matrix of pairwise distances between vertices rather than the adjacency…

Given a countable dense subset $S$ of a finite-dimensional normed space $X$, and $0<p<1$, we form a random graph on $S$ by joining, independently and with probability $p$, each pair of points at distance less than $1$. We say that $S$ is…