Highly irregular graphs

Yousef Alavi, G. C., Chung, F. R. K., Erdös, P., Graham, R. L., & Oellermann, O. R. (1987). Highly irregular graphs.

Type

Unclassified

Intellectual base

Unclassified

Year

1987

DOI

10.1002/jgt.3190110214

Link

https://doi.org/10.1002/jgt.3190110214

Cited by

1 citation across 1 artifact.

Domain-specific

• Highly irregular graph
  • … constitutive identity and a convenient observable transfers from A star with at least two leaves is not highly irregular because the center's neighbors all have degree one. to A graph computation uses open neighborhoods and handles vertices of degree zero or one as vacuous local cases under the stated convention..

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:e0d299a12119 · see in the full table