K_(1, 3)

(1, 3)-complete 2-partite graph | (1, 3)-complete bipartite graph | (3, 1)-Cayley tree | (3, 1)-stacked book graph | 3-matchstick graph 2 | 4-edge-transitive graph 4 | 4-graph 4 | 4-star graph | 4-tree 2 | Y graph

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

acyclic | apex | asymmetric | Beineke | bicolorable | bipartite | bridged | cactus | caterpillar | chordal | chordless | chromatically nonunique | class 1 | complete bipartite | complete k-partite | complete tree | connected | determined by resistance | determined by spectrum | edge-transitive | forest | geodetic | graceful | lobster | matchstick | median | Metelsky | noncayley | nonempty | noneulerian | nonhamiltonian | no perfect matching | outerplanar | perfect | planar | projective planar | pseudoforest | pseudotree | series-reduced | simple | spider | split | square-free | stacked book | star | strongly perfect | tree | triangle-free | tripod | uniquely colorable | unit-distance | untraceable | weakly perfect

triangle and singleton

triangle graph

vertex degrees | 1 (3 vertices) | 3 (1 vertex)

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

x^2 (x^2 - 3)

(x + 1)^3

x^3

chromatic number | 2 edge chromatic number | 3

(-sqrt(3))^1 0^2 sqrt(3)^1

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

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

Hosoya index | 4 Kirchhoff index | 9 stability index | 4 Wiener index | 9