相关论文: Edge-connectivity matrices and their spectra

Let $\kappa'(G)$, $\kappa(G)$, $\mu_{n-1}(G)$ and $\mu_1(G)$ denote the edge-connectivity, vertex-connectivity, the algebraic connectivity and the Laplacian spectral radius of $G$, respectively. In this paper, we prove that for integers…

We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.

The eccentricity of a vertex $v$ in a graph $G$ is the maximum distance between $v$ and any other vertex of $G$. The diameter of a graph $G$ is the maximum eccentricity of a vertex in $G$. The eccentric connectivity index of a connected…

The second smallest eigenvalue of the Laplacian matrix is determinative in characterizing many network properties and is known as algebraic connectivity. In this paper, we investigate the problem of maximizing algebraic connectivity in…

A monitoring edge-geodetic set, or simply an MEG-set, of a graph $G$ is a vertex subset $M \subseteq V(G)$ such that given any edge $e$ of $G$, $e$ lies on every shortest $u$-$v$ path of $G$, for some $u,v \in M$. The monitoring…

Let $G$ be a (multi)graph of order $n$ and let $u,v$ be vertices of $G$. The maximum number of internally disjoint $u$-$v$ paths in $G$ is denoted by $\kappa_G(u,v)$, and the maximum number of edge-disjoint $u$-$v$ paths in $G$ is denoted…

For a graph $G$, we associate a family of real symmetric matrices, $S(G)$, where for any $A\in S(G)$, the location of the nonzero off-diagonal entries of $A$ are governed by the adjacency structure of $G$. Let $q(G)$ be the minimum number…

The conditional $h$-vertex($h$-edge) connectivity of a connected graph $H$ of minimum degree $ k > h$ is the size of a smallest vertex(edge) set $F$ of $H$ such that $H - F$ is a disconnected graph of minimum degree at least $h.$ Let $G$ be…

We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…

A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. If the isolated vertex is excluded as trivial, nut graphs have seven or more vertices;…

Let $G$ be a connected tree on $n$ vertices and let $L = D-A$ denote the Laplacian matrix on $G$. The second-smallest eigenvalue $\lambda_{2}(G) > 0$, also known as the algebraic connectivity, as well as the associated eigenvector $\phi_2$…

Let $\mu_2(G)$ be the second smallest Laplacian eigenvalue of a graph $G$. The vertex connectivity of $G$, written $\kappa(G)$, is the minimum size of a vertex set $S$ such that $G-S$ is disconnected. Fiedler proved that $\mu_2(G) \le…

For a graph $G$ and for two distinct vertices $u$ and $v$, let $\kappa(u,v)$ be the maximum number of vertex-disjoint paths joining $u$ and $v$ in $G$. The average connectivity matrix of an $n$-vertex connected graph $G$, written…

For a graph $G$, we define $\sigma_2(G)=min \{d(u)+d(v)| u,v\in V(G), uv\not\in E(G)\}$, or simply denoted by $\sigma_2$. A edge-colored graph is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct…

Let $D(G)$ denote the distance matrix of a connected graph $G$ with $n$ vertices. The distance spectral gap of a graph $G$ is defined as $\delta_{D^G} = \rho_1 - \rho_2$, where $\rho_1$ and $\rho_2$ represent the largest and second largest…

The principal ratio of a connected graph $G$, $\gamma(G)$, is the ratio between the largest and smallest coordinates of the principal eigenvector of the adjacency matrix of $G$. Over all connected graphs on $n$ vertices, $\gamma(G)$ ranges…

We study network robustness under correlated failures modeled by colors, where each color represents a class of edges or vertices that may fail simultaneously. An edge-colored graph is said to be edge-color-avoiding $k$-edge-connected if it…

The enhanced power graph of a group $G$ is a graph with vertex set $G,$ where two distinct vertices $x$ and $y$ are adjacent if and only if there exists an element $w$ in $G$ such that both $x$ and $y$ are powers of $w.$ In this paper, we…

We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower…