✦ LIBER ✦

The connectivity index of a weighted graph

✍ Scribed by O. Araujo; J.A. de la Peña

Book ID: 104156437
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 435 KB
Volume: 283
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(98)10096-4

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

The rainbow connectivity of a graph

✍ Gary Chartrand; Garry L. Johns; Kathleen A. McKeon; Ping Zhang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

Maximum Zagreb index, minimum hyper-Wien

Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity

✍ A. Behtoei; M. Jannesari; B. Taeri 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 389 KB

Connectivity of the Mycielskian of a gra

Connectivity of the Mycielskian of a graph

✍ R. Balakrishnan; S. Francis Raj 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Traversability and connectivity of the m

Traversability and connectivity of the middle graph of a graph

✍ Takashi Hamada; Izumi Yoshimura 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 871 KB

On the maximal index of connected graphs

✍ F.K. Bell 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 673 KB

Local connectivity of a random graph

✍ P. Erdös; E. M. Palmer; R. W. Robinson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract A graph is locally connected if for each vertex ν of degree __≧2__, the subgraph induced by the vertices adjacent to ν is connected. In this paper we establish a sharp threshold function for local connectivity. Specifically, if the probability of an edge of a labeled graph of order __n_