(800) 434-2582
Call Now!Franchise Info

Get Math Help

Math Reading Science Test Prep

GET TUTORING NEAR ME!

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

    Home / Get Math Help

    (1, 1)-black Bishop Graph

    Image

    Image

    Notation

    K_1

    Alternate names

    0-hypercube graph | 0-Pell graph | 0-triangular grid graph | (1, 0)-permutation star graph | (1, 1, 1, 1)-grid graph | (1, 1, 1)-grid graph | (1, 1)-antelope graph | (1, 1)-bishop graph | (1, 1)-black bishop graph | (1, 1)-camel graph | ...

    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 | block | bridgeless | Bruhat | cactus | camel | caterpillar | Cayley graphs | chordal | chordless | chromatically unique | circulant | class 1 | claw-free | complete | complete k-partite | complete tree | conformally rigid | connected | controllable | determined by resistance | determined by spectrum | distance-hereditary | distance-regular | distance-transitive | dominating unique | edge-transitive | empty | Eulerian | fiveleaper | forest | geodetic | giraffe | graceful | grid | halved cube | Hamilton-connected | Hamilton-decomposable | Hamiltonian | Hamilton-laceable | highly irregular | H-star connected | hypercube | identity | integral | king | Kneser | knight | KP | k-tree | Laman | LCF | line graphs | linklessly embeddable | lobster | Lucas cube | map | matchstick | median | Meyniel | Mycielski | nongeometric | no perfect matching | odd | Ore | outerplanar | path | path complement | Pell | perfect | permutation star | planar | projective planar | pseudoforest | pseudotree | Ptolemaic | quadratically embeddable | queen | regular | rigid | rook | rook complement | self-complementary | series-reduced | simple | smallest fully forested | 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 | unigraphic | uniquely colorable | uniquely embeddable | uniquely graceful | uniquely Hamiltonian | unit-distance | unswitchable | 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