✦ LIBER ✦

A lower bound on the eccentric connectivity index of a graph

✍ Scribed by M.J. Morgan; S. Mukwembi; H.C. Swart

Book ID: 113564689
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 257 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.09.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower-bounds on the connectivities of a

Lower-bounds on the connectivities of a graph

✍ Abdol H. Esfahanian 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB 👁 1 views

On a lower bound for the connectivity of

On a lower bound for the connectivity of the independence complex of a graph

✍ Michał Adamaszek; Jonathan Ariel Barmak 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 187 KB

A lower bound on connectivities of matro

A lower bound on connectivities of matroid base graphs

✍ Guizhen Liu 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 853 KB

The connectivity of a graph G and the corank of a matroid M are denoted by K(G) and p, respectively. X is shown that if a graph G is the base graph of a simple mat&d M, then K(G) L 2p and the lower bound of 2p izA best possible.

A lower bound for algebraic connectivity

A lower bound for algebraic connectivity based on the connection-graph-stability method

✍ Ali Ajdari Rad; Mahdi Jalili; Martin Hasler 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 323 KB

The connectivity index of a weighted gra

The connectivity index of a weighted graph

✍ O. Araujo; J.A. de la Peña 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 435 KB

of length m in G and d, denotes the degre,e of the vertex i. We find upper bounds for "z(G) using the eigenvalues of the Laplaci~.m matrix of an associated weighted graph.

A lower bound on the independence number

A lower bound on the independence number of a graph

✍ Jochen Harant 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given. (~