GET TUTORING NEAR ME!

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

    Home / Get Math Help

    8-cubic Graph 2

    Image

    Basic properties

    vertex count | 8 edge count | 12 connected component count | 1

    Graph features

    apex | asymmetric | biconnected | bridgeless | chromatically unique | class 1 | connected | cubic | cyclic | determined by resistance | determined by spectrum | dominating unique | flexible | fully reconstructible in C^1 | graceful | Halin | Hamilton-connected | Hamilton-decomposable | Hamiltonian | H-star connected | imperfect | LCF | linklessly embeddable | map | multigraphic | noncayley | nonempty | noneulerian | nongeometric | pancyclic | perfect matching | planar | polyhedral | projective planar | quadratically embeddable | regular | simple | switchable | traceable | uniquely embeddable | unit-distance | weakly perfect | weakly regular

    Complement graph

    8-quartic graph 4

    Dual graph

    tritetrahedral graph

    Line graph

    (not a named graph)

    Graph degrees

    vertex degrees | 3 (8 vertices)

    Topological properties

    radius | 2 diameter | 3 girth | 3 vertex connectivity | 3 edge connectivity | 3

    Graph polynomials

    (x - 3) (x - 1) (x + 1)^2 (x^2 - 3) (x^2 + 2 x - 1)

    x^7 y^5 + 12 x^7 y^4 + 66 x^7 y^3 + 210 x^7 y^2 + 389 x^7 y + 336 x^7 + 10 x^6 y^3 + 106 x^6 y^2 + 431 x^6 y + 670 x^6 + 25 x^5 y^2 + 251 x^5 y + 700 x^5 + 3 x^4 y^2 + 92 x^4 y + 475 x^4 + 20 x^3 y + 218 x^3 + 2 x^2 y + 66 x^2 + 12 x + 1

    x^7 + 5 x^6 + 2 x^5 y + 13 x^5 + 10 x^4 y + 23 x^4 + 3 x^3 y^2 + 26 x^3 y + 29 x^3 + 16 x^2 y^2 + 43 x^2 y + 23 x^2 + 10 x y^3 + 35 x y^2 + 35 x y + 8 x + y^5 + 7 y^4 + 18 y^3 + 20 y^2 + 8 y

    Coloring properties

    chromatic number | 3 edge chromatic number | 3

    Spectrum

    (-1 - sqrt(2))^1 (-sqrt(3))^1 (-1)^2 (-1 + sqrt(2))^1 1^1 sqrt(3)^1 3^1

    Associated matrices

    (0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0)

    (1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1)

    Graph indices

    Hosoya index | 102 Kirchhoff index | 20.57 stability index | 96 Wiener index | 46