Conditions for the parameters of the block graph of quasi-symmetric designs
zbMATH Open1307.05024MaRDI QIDQ2256133FDOQ2256133
Authors: Rajendra M. Pawale, Shubhada M. Nyayate, M. S. Shrikhande 
Publication date: 19 February 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p36
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Characterization of quasi-symmetric designs with eigenvalues of their block graphs
- Non-existence of quasi-symmetric designs with restricted block graphs
- Quasi-symmetric designs with fixed difference of block intersection numbers
- Quasi‐Symmetric Designs with Good Blocks
- Quasi-symmetric designs with good blocks and intersection number one
- scientific article; zbMATH DE number 4008401
- Quasi-symmetric designs with the difference of block intersection numbers two
- Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
- Quasi-symmetric balanced incomplete block designs
Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of finite geometries (05B25) Other designs, configurations (05B30)
Cites Work
- Spectra of graphs
- Problems in algebraic combinatorics
- Strongly regular graphs with smallest eigenvalue -m
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Dale Mesner, Higman \& Sims, and the strongly regular graph with parameters \((100,22,0,6)\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorics of symmetric designs
- The structure of triangle-free quasi-symmetric designs
- Quasi-symmetric 2,3,4-designs
- Designs with no three mutually disjoint blocks
- Quasi-symmetric designs with fixed difference of block intersection numbers
- Quasi-symmetric designs with the difference of block intersection numbers two
- On quasi-symmetric designs with intersection difference three
- Title not available (Why is that?)
- Strongly Regular Graphs Derived from Combinatorial Designs
- Binary codes and quasi-symmetric designs
- Non existence of triangle free quasi-symmetric designs.
- Binary representations of regular graphs
- Quasi-symmetric 3-designs with triangle-free graph
- Quasi-symmetric designs related to the triangular graph
- A note on triangle-free quasi-symmetric designs
- Finiteness Results in Triangle‐Free Quasi‐Symmetric Designs
- A new quasi-symmetric 2-(56,\,16,\,6) design obtained from codes
- Title not available (Why is that?)
- Non-Existence of Some Unsymmetrical Partially Balanced Incomplete Block Designs
- Title not available (Why is that?)
- Finiteness questions in quasi-symmetric designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- There is no (46, 6, 1) block design
Cited In (8)
- Quasi-symmetric designs on 56 points
- Non-existence of quasi-symmetric designs with restricted block graphs
- Parametric restrictions on quasi-symmetric designs
- Ovoids of generalized quadrangles of order and Delsarte cocliques in related strongly regular graphs
- The adjacency codes of the first yellow graphs
- New quasi-symmetric designs by the Kramer-Mesner method
- Non-derivable strongly regular graphs from quasi-symmetric designs
- Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs
Uses Software
This page was built for publication: Conditions for the parameters of the block graph of quasi-symmetric designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256133)
