✦ LIBER ✦

On the maximum and minimum Zagreb indices of graphs with connectivity at most

✍ Scribed by Shuchao Li; Haibing Zhou

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 401 KB
Volume: 23
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.08.015

No coin nor oath required. For personal study only.

✦ Synopsis

a b s t r a c t For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M 2 is equal to the sum of the products of degrees of pairs of adjacent vertices. In this paper, we study the Zagreb indices of graphs of order n with κ(G) ≤ k (resp. κ (G) ≤ k) and sharp lower and upper bounds are obtained for

, where V k n is the set of graphs of order n with κ(G) ≤ k ≤ n -1, and E k n is the set of graphs of order n with κ (G) ≤ k ≤ n -1.

📜 SIMILAR VOLUMES

The rainbow connection of a graph is (at

The rainbow connection of a graph is (at most) reciprocal to its minimum degree

✍ Michael Krivelevich; Raphael Yuster 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

## Abstract An edge‐colored graph __G__is __rainbow edge‐connected__ if any two vertices are connected by a path whose edges have distinct colors. The __rainbow connection__ of a connected graph __G__, denoted by __rc__(__G__), is the smallest number of colors that are needed in order to make __G__

Realizability of p-point graphs with pre

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity

✍ F. T. Boesch; C. L. Suffel 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

## Abstract It is well known that certain graph‐theoretic extremal questions play a central role in the study of communication network vulnerability. Herein we consider a generalization of some of the classical results in this area. We define a (__p__, Δ, δ, λ) graph as a graph having __p__ points,

Graph decomposition with constraints on

Graph decomposition with constraints on the connectivity and minimum degree

✍ Carsten Thomassen 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

## Abstract For each pair __s,t__ of natural numbers there exist natural numbers __f(s,t)__ and __g(s,t)__ such that the vertex set of each graph of connectivity at least __f(s,t)__ (respectively minimum degree at least __g(s,t))__ has a decomposition into sets which induce subgraphs of connectivit

Realizability of p-point, q-line graphs

Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree

✍ D. DiMarco 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB 👁 3 views

The Maximum Genus of a Graph with Given

The Maximum Genus of a Graph with Given Diameter and Connectivity

✍ Hung-Lin Fu; Ming-Chun Tsai 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 354 KB

On the edge-reconstruction of 3-connecte

On the edge-reconstruction of 3-connected planar graphs with minimum valency 4

✍ Yue Zhao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 550 KB

It is shown that a 3-connected planar graph with minimum valency 4 is edge-reconstructible if no 4-vertex is adjacent to a 5-vertex. ## 1. Introduction In this paper, all graphs G=(V(G),E(G)) considered will be finite and simple. A connected graph G is said to have connectivity k o = ko(G) if the