𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the minimal eccentric connectivity indices of graphs

✍ Scribed by Jianbin Zhang; Bo Zhou; Zhongzhu Liu

Book ID
113567475
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
348 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The connectivity of minimal imperfect gr
The connectivity of minimal imperfect graphs
✍ SebοΏ½, AndrοΏ½s πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 535 KB

We prove that partitionable graphs are 2w -2-connected, that this bound is sharp, and prove some structural properties of cutsets of cardinality 2w -2. The proof of the connectivity result is a simple linear algebraic proof.

On minimal neighbourhood-connected graph
On minimal neighbourhood-connected graphs
✍ Bert L. Hartnell; William Kocay πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 809 KB

Hartnell, B.L. and W. Kocay, On minimal neighbourhood-connected graphs, Discrete Mathematics 92 (1991) 95-105. The closed neighbourhood of a vertex u of a graph G is u\* = {v 1 v is adjacent to u} U {u}. G is neighbourhood-connected if it is connected, and G -u' is connected but not complete, for al

On Minimally (n, Ξ»)-Connected Graphs
On Minimally (n, Ξ»)-Connected Graphs
✍ Atsushi Kaneko; Katsuhiro Ota πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 128 KB

A graph G is (n, \*)-connected if it satisfies the following conditions: (1) |V(G)| n+1; (2) for any subset S V(G) and any subset L E(G) with \* |S| +|L| <n\*, G&S&L is connected. The (n, \*)-connectivity is a common extension of both the vertex-connectivity and the edge-connectivity. An (n, 1)-conn

On the vertex degree indices of connecte
On the vertex degree indices of connected graphs
✍ Tomislav DoΕ‘liΔ‡; TamΓ‘s RΓ©ti; Damir VukičeviΔ‡ πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 219 KB