- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
On the graphical characterization of the projective space over a finite field
Search this article
Description
We shall construct the graphs whose vertex set is the set of all k-dimension projective subspaces of PG(n, q), two vertices being joined by an edge whenever they have a (k 1 )-dimension projective subspace in common. Then these graphs satisfy the condition (ii), and for two vertices c1 and B, with d(cr, /I) = 2, d(cr)nd(/?) is isomorphic to L,(t). (d is a distance function.) I received the advice that Theorem A is generalized by applying the main theorem of Cohen [4] as follows: 143 0095-8956/85 $3.00
Journal
-
- Journal of Combinatorial Theory, Series B
-
Journal of Combinatorial Theory, Series B 38 143-155, 1985-04-01
Elsevier BV
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1872835442668635520
-
- ISSN
- 00958956
-
- Data Source
-
- OpenAIRE