Cores and independence numbers of Grassmann graphs
DOI10.1007/s00373-017-1858-4zbMath1380.05133OpenAlexW2767087851MaRDI QIDQ1696546
Publication date: 14 February 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1858-4
Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial geometries and geometric closure systems (51D20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Homomorphism, automorphism and dualities in linear incidence geometry (51A10)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of optimal constant-dimension subspace codes
- On endomorphisms of alternating forms graph
- 2-spreads and transitive and orthogonal 2-parallelisms of \(PG(5, 2)\)
- Cores of geometric graphs
- Galois geometries and coding theory
- Diameter preserving bijections between Grassmann spaces over Bezout domains
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Blocking sets and partial spreads in finite projective spaces
- On maximal partial spreads in \(PG\)(\(n\), \(q\))
- On parallelisms in finite projective spaces
- Graphs associated with matrices over finite fields and their endomorphisms
- Factors of the Gaussian coefficients
- The endomorphisms of Grassmann graphs
- Primitivity and independent sets in direct products of vertex-transitive graphs
- Coding for Errors and Erasures in Random Network Coding
- The power of a prime that divides a generalized binomial coefficient.
- Geometry of Semilinear Embeddings
- Error-Correcting Codes in Projective Space
- CORES OF SYMMETRIC GRAPHS
This page was built for publication: Cores and independence numbers of Grassmann graphs