On strongly regular graphs with \mu=1

J Deutsch, P. H. F. (2000). On strongly regular graphs with \mu=1.

Type

Unclassified

Intellectual base

Unclassified

Year

2000

DOI

10.1006/eujc.2000.0472

Link

https://doi.org/10.1006/eujc.2000.0472

Cited by

1 citation across 1 artifact.

Domain-specific

• Strongly regular graph
  • … and a convenient observable transfers from A canonical example satisfies the full defining rule of Strongly regular graph with every parameter and convention explicit. to A careful use of Strongly regular graph tests its carrier, assumptions, boundary and nearest confusable rather than relying on the label alone..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:38ed2037489c · see in the full table