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

    Image

    Notation

    K_1

    Basic properties

    vertex count | 1 edge count | 0 connected component count | 1

    Graph features

    acyclic | alternating group | antelope | antipodal | apex | bicolorable | bipartite | bishop | black bishop | bridgeless | Bruhat | cactus | camel | caterpillar | Cayley graphs | chordal | chordless | chromatically unique | circulant | class 1 | claw-free | complete | complete k-partite | complete tree | connected | determined by resistance | determined by spectrum | distance-regular | distance-transitive | edge-transitive | empty | Eulerian | fiveleaper | forest | geodetic | giraffe | graceful | grid | halved cube | Hamilton-connected | Hamilton-decomposable | Hamiltonian | Hamilton-laceable | H-star connected | hypercube | identity | integral | king | Kneser | knight | Laman | LCF | line graphs | lobster | matchstick | median | Mycielski | no perfect matching | odd | Ore | outerplanar | path | path complement | perfect | permutation star | planar | projective planar | pseudoforest | pseudotree | queen | regular | rook | rook complement | self-complementary | series-reduced | simple | split | square-free | star | strongly perfect | strongly regular | symmetric | traceable | transposition | tree | triangle-free | triangular | triangular grid | triangular honeycomb acute knight | triangular honeycomb bishop | triangular honeycomb king | triangular honeycomb obtuse knight | triangular honeycomb queen | triangular honeycomb rook | triangular snake | Turán | uniquely colorable | unit-distance | vertex-transitive | weakly perfect | well covered | white bishop | zebra | zero-two

    Complement graph

    singleton graph

    Line graph

    null graph

    Graph degrees

    vertex degrees | 0 (1 vertex)

    Topological properties

    radius | 0 diameter | 0 girth | ∞ vertex connectivity | 0

    Graph polynomials

    -x

    1

    1

    Coloring properties

    chromatic number | 1 edge chromatic number | 0

    Spectrum

    0^1

    Associated matrices

    {0}

    Graph indices

    Hosoya index | 1 Kirchhoff index | 0 stability index | 0 Wiener index | 0

    Back to List | POWERED BY THE WOLFRAM LANGUAGE