๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Conjectures on index and algebraic connectivity of graphs

โœ Scribed by Kinkar Ch. Das

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
354 KB
Volume
433
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The algebraic connectivity of graphs und
The algebraic connectivity of graphs under perturbation
โœ Ji-Ming Guo ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 160 KB

In this paper, we investigate how the algebraic connectivity of a connected graph behaves when the graph is perturbed by separating or grafting an edge.

On some conjectures on cubic 3-connected
On some conjectures on cubic 3-connected graphs
โœ Jean-Luc Fouquet; Henri Thuillier ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 969 KB

Our purpose is to consider the following conjectures: Conjecture 1 (Barneffe). . Every cubic 3-connected bipartite planar graph is Hamiltonian. Conjecture 2 (Jaeger). Every cubic cyclically 4-edge connected graph G has a cycle C such that G -V(C) is acyclic. Conjecture 3 (Jackson, Fleischner). Ever

On the algebraic connectivity of graphs
On the algebraic connectivity of graphs as a function of genus
โœ Jason J. Molitierno ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 295 KB

We find an upper bound on the algebraic connectivity of graphs of various genus. We begin by showing that for fixed k 1, the graph of genus k of largest algebraic connectivity is a complete graph. We then find an upper bound for noncomplete graphs of a fixed genus k 1 and we determine the values of