Assertion: graph's node | /r/HasProperty | adjacent
Facets:
value: to it
type: OTHER
value: to exactly one leaf
type: OTHER
Source sentences:
text: Trees are a special case of bipartite graphs, and testing whether a tree is well-covered can be handled as a much simpler special case of the characterization of well-covered bipartite graphs: if G is a tree with more than two vertices, it is well-covered if and only if each non-leaf node of the tree is adjacent to exactly one leaf.
text: If there is an edge that connects two nodes, we say that those nodes are adjacent.
text: The neighbourhood of a node v, denoted N ( v ) {\displaystyle N(v)} , is the set of all the nodes that are adjacent to it.
text: Two nodes are adjacent if there is an edge connecting them.