GET TUTORING NEAR ME!

By providing your phone number, you consent to receive text messages from Club Z! for purposes related to our services. Message frequency may vary. Message and Data Rates may apply. Reply HELP for help or STOP to unsubscribe. See our Privacy Policy and our Terms and Conditions page

    Home / Get Math Help

    (1, 1, 2)-grid Graph

    Image

    Notation

    P_2

    Basic properties

    vertex count | 2 edge count | 1 connected component count | 1

    Graph features

    acyclic | almost controllable | Andrásfai | antipodal | apex | arc-transitive | arrangement | bicolorable | bipartite | black bishop | block | bridged | Bruhat | cactus | caterpillar | Cayley graphs | centipede | chordal | chordless | chromatically unique | circulant | class 1 | claw-free | complete | complete bipartite | complete k-partite | conformally rigid | connected | determined by resistance | determined by spectrum | distance-hereditary | distance-regular | distance-transitive | dominating unique | Dorogovtsev-Goltsev-Mendes | edge-transitive | Fibonacci cube | folded cube | forest | geodetic | geometric | graceful | grid | Haar | halved cube | Hamilton-connected | Hamilton-laceable | Hamming | highly irregular | H-star connected | hypercube | integral | Johnson | king | Kneser | Knödel | KP | k-tree | ladder | ladder rung | Laman | line graphs | linklessly embeddable | lobster | local | map | matchstick | maximally nonhamiltonian | median | Meyniel | Mycielski | nonempty | noneulerian | nonhamiltonian | nuciferous | Ore | outerplanar | path | Pell | perfect | perfect matching | permutation star | planar | projective planar | pseudoforest | pseudotree | Ptolemaic | quadratically embeddable | queen | regular | rigid | rook | series-reduced | simple | smallest fully forested | split | spoke | square-free | stacked book | star | strongly perfect | symmetric | traceable | transposition | tree | triangle-free | Turán | unigraphic | uniquely colorable | uniquely embeddable | uniquely graceful | unit-distance | unswitchable | vertex-transitive | weakly perfect | weakly regular | well covered | white bishop | zero-two

    Complement graph

    2-empty graph

    Line graph

    singleton graph

    Graph degrees

    vertex degrees | 1 (2 vertices)

    Topological properties

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

    Graph polynomials

    (x - 1) (x + 1)

    x + 1

    x

    Coloring properties

    chromatic number | 2 edge chromatic number | 1

    Spectrum

    (-1)^1 1^1

    Associated matrices

    (0 | 1 1 | 0)

    (1 1)

    Graph indices

    Hosoya index | 2 Kirchhoff index | 1 stability index | 2 Wiener index | 1