What people are saying - Write a review
We haven't found any reviews in the usual places.
IIC Connectedness and Components
18 other sections not shown
Other editions - View all
admits algebra articulation vertex association scheme assume az-paths biconnected bijection bipartite graph block called cardinality Clearly cocycle space color color-perfect complement complete graph component condition connected contains Corollary cycle space define definition denote directed graph disjoint edge set elementary circuit elementary cycle elements equality holds equivalent exactly example exchange system Exercise exists feasible flow follows given Hadamard matrix Hence incidence matrix induction hypothesis integer isolated vertices isomorphic isthmus lattice Lemma m-family matching matroid minimal Mobius function multigraph n-set n(qu nonempty obtain openly-disjoint orthogonal pairwise-disjoint parameters partial geometry partially-ordered set partition path PBIB-design permutation planar graph planar imbedding Proof Proposition Prove respectively result satisfies set system Show spanning subgraph submultigraph subset subspace suppose surjection transversal matroid valence vector space verify vertex cocycle vertex set xu x2 yields