Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Graph structure having maximum algebraic connectivity among some given blocks

using this code we get a graph on 4 blocks of which 3 are pendant block(pendant in the sense that it has exactly one cut vertex).Now can we have some sage code that gives all connected graphs with these 4block of which exactly 3 blocks are pendant and also among those collection we need that graph having maximum algebraic conectivity