scientific article; zbMATH DE number 3547309
From MaRDI portal
Publication:4121914
Cited in
(only showing first 100 items - show all)- On self-complementary strongly regular graphs
- Recent developments on graphs of bounded clique-width
- The idiosyncratic polynomial of digraphs
- Partial Complement of a Graph
- Characterizing distance-regularity of graphs by the spectrum
- Numerical measures for two-graphs
- The distance of a subspace of \(R^ m\) from its axes and n-widths of octahedra
- Equiangular tight frames from complex Seidel matrices containing cube roots of unity
- Binary codes and quasi-symmetric designs
- A global code invariant under the Higman-Sims group
- Coverings and automorphisms of chamber systems
- Toward the classification of biangular harmonic frames
- Hypercubes are determined by their distance spectra
- Two-graphs and skew two-graphs in finite geometries
- Conference matrices from projective planes of order 9
- Type-II matrices in weighted Bose-Mesner algebras of ranks 2 and 3
- Sparse representations and approximation theory
- Transitivity of local complementation and switching on graphs.
- On near subgroups
- On perfect switching classes
- On Switching to H‐Free Graphs
- The road to deterministic matrices with the restricted isometry property
- Johan Jacob Seidel
- Partial complementation of graphs
- Association schemes on triples and a ternary algebra
- Algorithmic aspects of switch cographs
- Partially ordering the class of invertible trees
- Graphs whose normalized Laplacian has three eigenvalues
- Spherical codes and designs
- On strongly regular signed graphs
- Pick's inequality and tournaments
- The Hermitian two-graph and its code
- A census of infinite distance-transitive graphs
- The regular two-graph on 276 vertices
- Optimal frames for erasures.
- Small extended generalized quadrangles
- Some 2-ranks
- Is Taylor's graph geometric?
- Frames, graphs and erasures
- The overgraphs of generalized cospectral controllable graphs
- Nonexistence of ovoids in \(\Omega^+(10,3)\)
- Equiangular tight frames and signature sets in groups
- Two are better than one: fundamental parameters of frame coherence
- Switching classes of directed graphs
- Double covers of symplectic dual polar graphs
- Finite metrics in switching classes
- Steiner equiangular tight frames
- Covers of graphs and EGQs
- Regular two-graphs on 36 vertices
- Rational G-matrices with rational eigenvalues
- Finite two-distance tight frames
- Grassmannian frames with applications to coding and communication
- Optimal measures for \(p\)-frame energies on spheres
- Equiangular tight frames that contain regular simplices
- A characterisation of the generalized quadrangle \(Q(5,q)\) using cohomology
- Spectral results on regular graphs with \((k,\tau)\)-regular sets
- Two-graphs and trees
- Graph representations, two-distance sets, and equiangular lines
- A note on graphs with exactly two main eigenvalues
- Spaces with large projection constants
- Structural theory and classification of 2D Adinkras
- Signed graphs
- Strongly regular graphs having strongly regular subconstituents
- Small regular graphs with four eigenvalues
- Switching classes of directed graphs and H-equivalent matrices
- Pancyclicity in switching classes
- Signatures and signed switching classes
- On deciding switching equivalence of graphs
- Even signings, signed switching classes, and (-1,1)-matrices
- Nonregular graphs with three eigenvalues
- Packings in real projective spaces
- Attempting perfect hypergraphs
- Open problems in the spectral theory of signed graphs
- Automorphisms and cohomology of switching classes
- Graphs with most number of three point induced connected subgraphs
- Characterizations of line graphs in signed and gain graphs
- Subgraph complementation
- Embedding edge-colored complete graphs in binary affine spaces
- Two-geodesic-transitive graphs which are locally self-complementary
- On perfect switching classes
- EPPA for two-graphs and antipodal metric spaces
- Characterization of \(k\)-spectrally monomorphic two-graphs
- On the Grundy number of Cameron graphs
- Equiangular tight frames from group divisible designs
- On intersecting hypergraphs
- Weighted association schemes, fusions, and minimal coherent closures
- Regular weights of full rank on strongly regular graphs
- Diagram geometries for sharply \(n\)-transitive sets of permutations or of mappings
- Complementation, local complementation, and switching in binary matroids
- Inclusion transformations: \((n,m)\)-graphs and their classification
- A geometric construction of partial geometries with a Hermitian point graph
- Switching with more than two colours.
- Speeding up Graph Algorithms via Switching Classes
- Regular weights and the Johnson scheme
- Harmonic equiangular tight frames comprised of regular simplices
- Doubly transitive lines. I: Higman pairs and roux
- On split graphs with three or four distinct (normalized) Laplacian eigenvalues
- Globally optimizing small codes in real projective spaces
- A Short Introduction to Optimal Line Packings
- Polyphase equiangular tight frames and abelian generalized quadrangles
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 Q4121914)
