Get Math Help

GET TUTORING NEAR ME!

(800) 434-2582

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

    Home / Get Math Help

    (1, 3)-black Bishop Graph

    Image

    Notation

    K^__2

    Basic properties

    vertex count | 2 edge count | 0 connected component count | 2

    Graph features

    acyclic | apex | bicolorable | bipartite | bishop | black bishop | bridgeless | camel | Cayley graphs | chordal | chordless | chromatically unique | circulant | class 1 | claw-free | cocktail party | crown | determined by resistance | determined by spectrum | disconnected | distance-regular | distance-transitive | edge-transitive | empty | Eulerian | fiveleaper | forest | giraffe | integral | knight | line graphs | matchstick | nonhamiltonian | no perfect matching | outerplanar | path complement | perfect | planar | projective planar | pseudoforest | regular | rook complement | simple | split | square-free | strongly perfect | strongly regular | symmetric | triangle-free | Turán | ungraceful | uniquely colorable | unit-distance | untraceable | vertex-transitive | weakly perfect | well covered | white bishop | zebra

    Complement graph

    2-path graph

    Line graph

    null graph

    Graph degrees

    vertex degrees | 0 (2 vertices)

    Topological properties

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

    Graph polynomials

    x^2

    1

    1

    Coloring properties

    chromatic number | 1 edge chromatic number | 0

    Spectrum

    0^2

    Associated matrices

    (0 | 0 0 | 0)

    Graph indices

    Hosoya index | 1 Kirchhoff index | ∞ stability index | 1 Wiener index | ∞

    Back to List | POWERED BY THE WOLFRAM LANGUAGE