相关论文: Note on a relation between Randic index and algebr…

The {\it Randi\'c index} $R(G)$ of a graph $G$ is defined as the sum of 1/\sqrt{d_ud_v} over all edges $uv$ of $G$, where $d_u$ and $d_v$ are the degrees of vertices $u$ and $v,$ respectively. Let $D(G)$ be the diameter of $G$ when $G$ is…

The Randi\'{c} index $R(G)$ of a graph $G$ is defined as the sum of $(d_i d_j)^{-1/2}$ over all edges $v_i v_j$ of $G$, where $d_i$ is the degree of the vertex $v_i$ in $G$. The radius $r(G)$ of a graph $G$ is the minimum graph eccentricity…

The Randi\'c index of a graph $G$, denoted by $R(G)$, is defined as the sum of $1/\sqrt{d(u)d(v)}$ over all edges $uv$ of $G$, where $d(u)$ denotes the degree of a vertex $u$ in $G$. In this paper, we partially solve two conjectures on the…

Given a connected graph $G$, the Randi\'c index $R(G)$ is the sum of $\tfrac{1}{\sqrt{d(u)d(v)}}$ over all edges $\{u,v\}$ of $G$, where $d(u)$ and $d(v)$ are the degree of vertices $u$ and $v$ respectively. Let $q(G)$ be the largest…

The Randi{\' c} index of a graph $G$, written $R(G)$, is the sum of $\frac 1{\sqrt{d(u)d(v)}}$ over all edges $uv$ in $E(G)$. %let $R(G)=\sum_{uv \in E(G)} \frac 1{\sqrt{d(u)d(v)}}$, which is called the Randi{\' c} index of it. Let $d$ and…

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…

For a graph $G$, let $\lambda_2(G)$ denote its second smallest Laplacian eigenvalue. It was conjectured that $\lambda_2(G) + \lambda_2(\overline{G}) \geq 1$, where $\bar{G}$ is the complement of $G$. Here, we prove this conjecture in the…

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 investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded…

The generalized connectivity of a graph $G$ was introduced by Chartrand et al. Let $S$ be a nonempty set of vertices of $G$, and $\kappa(S)$ be defined as the largest number of internally disjoint trees $T_1, T_2, \cdots, T_k$ connecting…

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}…

We conjecture a new lower bound on the algebraic connectivity of a graph that involves the number of vertices of high eccentricity in a graph. We prove that this lower bound implies a strengthening of the Laplacian Spread Conjecture. We…

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…

Let $\delta$ and $\Delta$ be the minimum and the maximum degree of the vertices of a simple connected graph $G$, respectively. The distinguishing index of a graph $G$, denoted by $D'(G)$, is the least number of labels in an edge labeling of…

For a graph $G$, let $\lambda_2(G)$ denote its second smallest Laplacian eigenvalue. It was conjectured that $\lambda_2(G) + \lambda_2(\overline G) \ge 1$, where $\overline G$ is the complement of $G$. In this paper, it is shown that…

We investigate the threshold probability for connectivity of sparse graphs under weak assumptions. As a corollary this completely solve the problem for Cartesian powers of arbitrary graphs. In detail, let $G$ be a connected graph on $k$…

Let $G$ be a nontrivial connected graph of order $n$ and $k$ an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$ such…

The difference between the two largest eigenvalues of the adjacency matrix of a graph $G$ is called the spectral gap of $G.$ If $G$ is a regular graph, then its spectral gap is equal to algebraic connectivity. Abdi, Ghorbani and Imrich, in…

Among all simple 2-connected graphs, and among all $\theta$-graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.

We show that finding a graph realization with the minimum Randi\'c index for a given degree sequence is solvable in polynomial time by formulating the problem as a minimum weight perfect b-matching problem. However, the realization found…