What people are saying - Write a review
We haven't found any reviews in the usual places.
A Problem in Combinatorial Group Theory
A Class of Distance Convex Simple Graphs
On BDGraphs with the Sequence km11
9 other sections not shown
Other editions - View all
2t+l)-cycles assume automorphism free automorphism group basic cards basic tree bi-basic bicentral tree choose codewords combinatorial consider construction contradiction COROLLARY cut vertex d(TJ degree greater denote the collection disjoint Dp[T DT-endblock edges elements exists f e D^G G t-design graph G Graph Theory Hamilton cycle height h(L Hence hypergraph incidence matrix induced subgraph integers intersection graph isomorphic latin square graphs leaf least Lemma let a denote Let G limb equal limb of height line-critical block Math matrix maximal clique n-BD-graph neighbours of degree number of cards Otherwise p(TJ pair parameters permutation permutation matrix point of degree polynomials positive integers possible Proof R-maximal limb root vertex s-r+l semi-basic Singer set Steiner triple systems strongly regular graphs subgraph sublimb subset Suppose that p(T T-sequence Theorem 2.2 three limbs triads two-connected uniquely reconstructible vertex of degree vertices weight