Suppose we are given some blocks(in sense of graph theory). Now suppose we have to find out that graph(connected) which has maximum algebraic connectivity and consists of those given blocks. the blocks may be path graph,cycle etc.please explain with a sage code.
Revision history [back]
 | 1 | initial version | |
Graph having largest algebraic connectivity among some given blocks
| | 2 | retagged |
Graph having largest algebraic connectivity among some given blocks
Suppose we are given some blocks(in sense of graph theory). Now suppose we have to find out that graph(connected) which has maximum algebraic connectivity and consists of those given blocks. the blocks may be path graph,cycle etc.please explain with a sage code.
