GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Home / Get Math Help

    Egawa Graph

    Graphs with available data

    (1, 1)-Doob graph | (1, 2)-Doob graph | (1, 3)-Doob graph | (2, 1)-Doob graph

    Images

    Basic properties

    | vertex count | edge count | connected component count (1, 1)-Doob graph | 64 | 288 | 1 (1, 2)-Doob graph | 256 | 1536 | 1 (1, 3)-Doob graph | 1024 | 7680 | 1 (2, 1)-Doob graph | 1024 | 7680 | 1

    Common graph features

    asymmetric | biconnected | bridgeless | class 1 | connected | cyclic | distance-regular | Doob | Egawa | Hamilton-connected | Hamilton-decomposable | Hamiltonian | H-star connected | imperfect | integral | LCF | local | nonempty | nonplanar | not determined by spectrum | perfect matching | regular | simple | traceable | vertex-transitive | weakly perfect | weakly regular

    Complement graph

    | complement graph name (1, 1)-Doob graph | (not a named graph) (1, 2)-Doob graph | (not a named graph) (1, 3)-Doob graph | (not a named graph) (2, 1)-Doob graph | (not a named graph)

    Line graph

    | line graph name (1, 1)-Doob graph | (not a named graph) (1, 2)-Doob graph | (not a named graph) (1, 3)-Doob graph | (not a named graph) (2, 1)-Doob graph | (not a named graph)

    Topological properties

    | radius | diameter | girth (1, 1)-Doob graph | 3 | 3 | 3 (1, 2)-Doob graph | 4 | 4 | 3 (1, 3)-Doob graph | 5 | 5 | 3 (2, 1)-Doob graph | 5 | 5 | 3 | vertex connectivity | edge connectivity (1, 1)-Doob graph | 9 | 9 (1, 2)-Doob graph | 12 | 12 (1, 3)-Doob graph | 15 | 15 (2, 1)-Doob graph | 15 | 15

    Coloring properties

    | chromatic number | edge chromatic number (1, 1)-Doob graph | 4 | 9 (1, 2)-Doob graph | 4 | 12 (1, 3)-Doob graph | 4 | 15 (2, 1)-Doob graph | 4 | 15

    Back to List | POWERED BY THE WOLFRAM LANGUAGE