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, 1)-complete Tripartite Graph

    Image

    Notation

    C_3

    Basic properties

    vertex count | 3 edge count | 3 connected component count | 1

    Graph features

    alternating group | apex | arc-transitive | arrangement | biconnected | block | braced polygon | bridgeless | cactus | Cayley graphs | chordal | chordless | chromatically unique | circulant | class 2 | claw-free | complete | complete k-partite | complete tripartite | conformally rigid | connected | cycle | cyclic | determined by resistance | determined by spectrum | diagonal intersection | distance-hereditary | distance-regular | distance-transitive | dominating unique | Dorogovtsev-Goltsev-Mendes | edge-transitive | Eulerian | fan | geodetic | geometric | graceful | Hamilton-connected | Hamilton-decomposable | Hamiltonian | Hamming | Hanoi | Harary | H-star connected | integral | Johnson | KC | Kneser | KP | k-tree | Laman | LCF | line graphs | linklessly embeddable | local | map | matchstick | Meyniel | nonempty | no perfect matching | odd | Ore | outerplanar | pancyclic | pathwidth 1 forbidden minor | perfect | planar | polyiamond | projective planar | pseudoforest | pseudotree | Ptolemaic | quadratically embeddable | queen | regular | rigid | rook | Sierpiński gasket | simple | split | square-free | stacked prism | strongly perfect | strongly regular | symmetric | traceable | triangular | triangular grid | triangular honeycomb king | triangular honeycomb queen | triangular snake | triangulated | Turán | two-regular | unicyclic | unigraphic | uniquely colorable | uniquely embeddable | uniquely graceful | uniquely Hamiltonian | uniquely pancyclic | unit-distance | unswitchable | vertex-transitive | weakly perfect | well covered | wreath

    Complement graph

    3-empty graph

    Line graph

    triangle graph

    Graph degrees

    vertex degrees | 2 (3 vertices)

    Topological properties

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

    Graph polynomials

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

    x^2 y + 3 x^2 + 3 x + 1

    x^2 + x + y

    Coloring properties

    chromatic number | 3 edge chromatic number | 3

    Spectrum

    (-1)^2 2^1

    Associated matrices

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

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

    Graph indices

    Hosoya index | 4 Kirchhoff index | 2 stability index | 2 Wiener index | 3