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

    (1, 3, 3)-grid Graph

    Image

    Notation

    P_3×P_3

    Basic properties

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

    Graph features

    almost Hamiltonian | apex | asymmetric | bicolorable | biconnected | bipartite | bridgeless | chromatically unique | class 1 | connected | cyclic | determined by resistance | dominating nonunique | flexible | gear | graceful | grid | Jahangir | linklessly embeddable | map | matchstick | median | Meyniel | multigraphic | noncayley | nonempty | noneulerian | nongeometric | nonhamiltonian | no perfect matching | not determined by spectrum | perfect | planar | polyomino | projective planar | quadratically embeddable | simple | stacked book | switchable | traceable | triangle-free | uniquely colorable | uniquely embeddable | unit-distance | weakly perfect

    Complement graph

    (not a named graph)

    Line graph

    (not a named graph)

    Graph degrees

    vertex degrees | 2 (4 vertices) | 3 (4 vertices) | 4 (1 vertex)

    Topological properties

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

    Graph polynomials

    x^3 (x^2 - 8) (x^2 - 2)^2

    x^8 y^4 + 12 x^8 y^3 + 62 x^8 y^2 + 164 x^8 y + 192 x^8 + 4 x^7 y^3 + 56 x^7 y^2 + 281 x^7 y + 552 x^7 + 22 x^6 y^2 + 236 x^6 y + 808 x^6 + 4 x^5 y^2 + 116 x^5 y + 760 x^5 + 32 x^4 y + 491 x^4 + 4 x^3 y + 220 x^3 + 66 x^2 + 12 x + 1

    x^8 + 4 x^7 + 10 x^6 + 4 x^5 y + 16 x^5 + 12 x^4 y + 19 x^4 + 4 x^3 y^2 + 20 x^3 y + 16 x^3 + 10 x^2 y^2 + 20 x^2 y + 10 x^2 + 4 x y^3 + 12 x y^2 + 13 x y + 3 x + y^4 + 4 y^3 + 6 y^2 + 3 y

    Coloring properties

    chromatic number | 2 edge chromatic number | 4

    Spectrum

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

    Associated matrices

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

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

    Graph indices

    Hosoya index | 131 Kirchhoff index | 34.5 stability index | 0 Wiener index | 72