相关论文: Maximal Algebraic Connectivity for Paths with Fixe…

A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more…

We present a message-passing algorithm to solve the edge disjoint path problem (EDP) on graphs incorporating under a unique framework both traffic optimization and path length minimization. The min-sum equations for this problem present an…

In this paper we revisit the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal…

In this paper, we consider a network of agents with Laplacian dynamics, and study the problem of improving network robustness by adding a maximum number of edges within the network while preserving a lower bound on its strong structural…

In this note, we study Laplacians on graphs for which connectivity within certain subgraphs tends to infinity. Our main focus are graphs sharing a common node set on which edge weights within certain clusters grow to infinity. As…

We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…

We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…

For any undirected graph $G=(V,E)$ and a set $E_W$ of candidate edges with $E\cap E_W=\emptyset$, the $(k,\gamma)$-spectral augmentability problem is to find a set $F$ of $k$ edges from $E_W$ with appropriate weighting, such that the…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…

A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge…

For an $n$-vertex graph $G$, let $z(G;k)$ denote the number of zero forcing sets of size $k$. A conjecture of Boyer et al. asserts that the path $P_n$ maximizes these numbers coefficientwise among all $n$-vertex graphs; equivalently, the…

Let $\lambda_{1}(G)$ and $\mu_{1}(G)$ denote the spectral radius and the Laplacian spectral radius of a graph $G$, respectively. Li in [Electronic J. Linear Algebra 34 (2018) 389-392] proved sharp upper bounds of $\lambda_{1}(G)$ based on…

We make progress toward a characterization of the graphs $H$ such that every connected $H$-free graph has a longest path transversal of size $1$. In particular, we show that the graphs $H$ on at most $4$ vertices satisfying this property…

For a fixed positive integer $k$ and a graph $G$, let $\lambda_k(G)$ denote the $k$-th largest eigenvalue of the adjacency matrix of $G$. In 2017, Tait and Tobin proved that the maximum $\lambda_1(G)$ among all outerplanar graphs on $n$…

We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of…

Consider a semigraph $G=(V,\,E)$; in this paper, we study the eigenvalues of the Laplacian matrix of $G$. We show that the Laplacian of $G$ is positive semi-definite, and $G$ is connected if and only if $\lambda_2 >0.$ Along the similar…

Effective resistance (ER) is an attractive way to interrogate the structure of graphs. It is an alternative to computing the eigenvectors of the graph Laplacian. One attractive application of ER is to point clouds, i.e. graphs whose…

Denote the Laplacian of a graph $G$ by $L(G)$ and its second smallest Laplacian eigenvalue by $\lambda_2(G)$. If $G$ is a graph on $n\ge 2$ vertices, then it is shown that the second smallest eigenvalue of $L(G) + \frac{1}{n}…

Let $G$ be a connected graph. The edge-connectivity of $G$, denoted by $\lambda(G)$, is the minimum number of edges whose removal renders $G$ disconnected. Let $\delta(G)$ be the minimum degree of $G$. It is well-known that $\lambda(G) \leq…

A graph $G = (V,E)$ is globally rigid in $\mathbb{R}^d$ if for any generic placement $p : V \rightarrow \mathbb{R}^d$ of the vertices, the edge lengths $||p(u) - p(v)||, uv \in E$ uniquely determine $p$, up to congruence. In this paper we…