The following pages link to (Q4000288):
Displaying 50 items.
- Hulls of codes from incidence matrices of connected regular graphs (Q2436579) (← links)
- On independent star sets in finite graphs (Q2437349) (← links)
- The absolute bound for coherent configurations (Q2442217) (← links)
- Codes and caps from orthogonal Grassmannians (Q2447806) (← links)
- The Hall-Janko graph and the Witt system \(W_{10}\) (Q2462312) (← links)
- Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\) (Q2466505) (← links)
- Proper partial geometries with Singer groups and pseudogeometric partial difference sets (Q2469202) (← links)
- Determination of weight enumerators of binary extremal self-dual \([42,21,8]\) codes (Q2469480) (← links)
- Enumeration of the doubles of the projective plane of order 4 (Q2509290) (← links)
- On automorphisms of a generalized octagon of order (2, 4) (Q2518069) (← links)
- Disconnecting strongly regular graphs (Q2637232) (← links)
- A note on the Assmus-Mattson theorem for some binary codes (Q2672304) (← links)
- Search on vertex-transitive graphs by lackadaisical quantum walk (Q2681709) (← links)
- On symmetric association schemes and associated quotient-polynomial graphs (Q2700314) (← links)
- On the Commuting Graph of Dihedral Group (Q2815399) (← links)
- A note on triangle-free quasi-symmetric designs (Q2896010) (← links)
- A Family of Partial Geometric Designs from Three-Class Association Schemes (Q2957065) (← links)
- Primitive groups, graph endomorphisms and synchronization (Q2960608) (← links)
- A combinatorial approach to transitive extensions of generously unitransitive permutation groups (Q3057081) (← links)
- Superpure digraph designs (Q3150160) (← links)
- The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures (Q3296726) (← links)
- ON A DESIGN FROM PRIMITIVE REPRESENTATIONS OF THE FINITE SIMPLE GROUPS (Q3388620) (← links)
- Quasi-symmetric designs with fixed difference of block intersection numbers (Q3418725) (← links)
- On the average Cartier-Foata height of traces (Q3438975) (← links)
- Divisible Design Digraphs (Q3466747) (← links)
- Automorphisms of Terwilliger graphs with μ = 2 (Q3546137) (← links)
- Pseudo quasi-3 designs and their applications to coding theory (Q3578150) (← links)
- (Q4003201) (← links)
- Some simple and automorphism‐free 2‐(15,5,4) designs (Q4373371) (← links)
- Proper S(t, K,v)'s for t ≥ 3,v ≤ 16, |K| > 1 and Their Extensions (Q4373394) (← links)
- COLORING CURVES ON SURFACES (Q4584908) (← links)
- On the metric dimension and diameter of circulant graphs with three jumps (Q4603875) (← links)
- Sesqui-arrays, a generalisation of triple arrays (Q4614036) (← links)
- New families of strongly regular graphs (Q4808411) (← links)
- Finiteness Results in Triangle‐Free Quasi‐Symmetric Designs (Q4921429) (← links)
- Classifying 3- and 4-designs on 28 points invariant under the group S6(2) (Q4965900) (← links)
- (Q4970660) (← links)
- (Q4971870) (← links)
- THE METRIC DIMENSION OF THE ANNIHILATING-IDEAL GRAPH OF A FINITE COMMUTATIVE RING (Q4989462) (← links)
- A Notion of Optimal Packings of Subspaces with Mixed-Rank and Solutions (Q5020132) (← links)
- More on graphs with just three distinct eigenvalues (Q5034276) (← links)
- Fractional metric dimension of generalized prism graph (Q5039459) (← links)
- (Q5076254) (← links)
- (Q5084852) (← links)
- Signed graphs with two eigenvalues and vertex degree five (Q5090511) (← links)
- (Q5121935) (← links)
- Periodicity of the Discrete-time Quantum Walk on a Finite Graph (Q5147817) (← links)
- Computing the upper bounds for the metric dimension of cellulose network (Q5211821) (← links)
- (Q5226058) (← links)
- An Assmus--Mattson Theorem for Rank Metric Codes (Q5232151) (← links)
