graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge. The neighbourhood of a vertex v in a graph G...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

time in the same direction you originally entered it. Neighbourhood (graph theory) King's graph Chain code Von Neumann neighborhood Weisstein, Eric W...

Neighbo(u)rhood(s) may also refer to: Neighbourhood (mathematics), a concept in topology Neighbourhood (graph theory), a grouping in graph theory the Moore neighborhood...

graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...

(sequence A266213 in the OEIS). Moore neighborhood Neighbourhood (graph theory) Taxicab geometry Lattice graph Pixel connectivity Chain code Toffoli, Tommaso;...

In the mathematical discipline of graph theory, a graph C is a covering graph of another graph G if there is a covering map from the vertex set of C to...

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...

its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. To...

In the mathematical field of graph theory, a word-representable graph is a graph that can be characterized by a word (or sequence) whose entries alternate...