scientific article; zbMATH DE number 3384021

MaRDI QIDQ5654053zbMATH OpenFDO

Authors T. D. Parsons, Judith Q. Longyear

Publication date 1972

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of finite geometries (05B25) Graph theory (05C99)

Cited in

(8)

• Fastest mixing reversible Markov chain on friendship graph: trade-off between transition probabilities among friends and convergence rate
• Comparison of two techniques for proving nonexistence of strongly regular graphs
• Ramsey Graphs and Block Designs. I
• On the extension of connected irregular (λ,μ)-graphs
• Bounding the number of hyperedges in friendship \(r\)-hypergraphs
• Infinite generalized friendship graphs
• Ramsey graphs and block designs
• Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5654053)