Assertion: graph | /r/HasProperty | symmetric
Facets:
value: about the origin
type: OTHER
value: about the lines
type: OTHER
value: about its axis
type: OTHER
value: in other words
type: DEGREE
value: automatically
type: DEGREE
value: by definition
type: OTHER
Source sentences:
text: This graph is symmetric about its axis; that is, it is symmetric about the line x = 3.
text: Graph B: This graph is symmetric about the axes; that is, it is symmetric about the lines x = 0 (the y-axis) and y = 0 (the x-axis).
text: Graph C: This graph is symmetric about the lines x = 1 and y = –2, and symmetric about the point (1, –2).
text: This graph is symmetric about slanty lines: y =
text: This graph is symmetric, but not about the origin or the y-axis.
text: However, the graph is also symmetric about the origin, so this function is odd.
text: In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u 1
text: In other words, a graph is symmetric if its automorphism group acts transitively upon ordered pairs of adjacent vertices (that is, upon edges considered as having a direction).
text: Such graphs are automatically symmetric, by definition.
text: For example, since the graph is symmetric , all edges are equivalent.
text: This graph is symmetric with respect to the y-axis, so when you enter f(-x) in the g box and graph again, you do not see anything new.
text: A function f is odd if its graph is symmetric with respect to the origin.