Prev: eigenvalues of a matrix
Next: 400YEARS OF" PURE PROVEN MATHEMATICAL STUPIDITY" OF CURRENT MATHEMATICS - RE PLACEMENT OF PRIME NUMBERS -MATHEMATICAL PROOF
From: Smith on 30 Jul 2010 09:10
How do I call an induced subgraph that is maximal under the
condition of being connected and not containing any bridges? On
a few occasions, this is called a "block". But usually, "block"
means a maximal connected and articulation-free induced subgraph.
So the term refers to vertex-connectivity. I am not sure whether
I should use it for edge-connectivity as well. Any suggestions?
 | 
Pages: 1
Prev: eigenvalues of a matrix
Next: 400YEARS OF" PURE PROVEN MATHEMATICAL STUPIDITY" OF CURRENT MATHEMATICS - RE PLACEMENT OF PRIME NUMBERS -MATHEMATICAL PROOF