What's the difference between
and
Enter two words to compare and contrast their definitions, origins, and synonyms to better understand how those words are related.

Graph vs Disassortative - What's the difference?

graph | disassortative |

In mathematics terms the difference between graph and disassortative

is that graph is a diagram displaying data, in particular one showing the relationship between two or more variables; specifically, for a function f(x_1, x_2, \ldots, x_n), the set of all tuples (x_1, x_2, \ldots, x_n, f(x_1, x_2, \ldots, x_n)) while disassortative is describing a graph (or network) in which nodes of low degree are more likely to connect with nodes high degree.

As a noun graph

is a diagram displaying data; in particular one showing the relationship between two or more quantities, measurements or indicative numbers that may or may not have a specific mathematical formula relating them to each other.

As a verb graph

is to draw a graph.

As an adjective disassortative is

describing a graph (or network) in which nodes of low degree are more likely to connect with nodes high degree.

graph

English

(wikipedia graph)

Noun

(en noun)
  • A diagram displaying data; in particular one showing the relationship between two or more quantities, measurements or indicative numbers that may or may not have a specific mathematical formula relating them to each other.
  • * {{quote-magazine, date=2012-03
    • , author= , title=Pixels or Perish , volume=100, issue=2, page=106 , magazine= citation , passage=Drawings and pictures are more than mere ornaments in scientific discourse. Blackboard sketches, geological maps, diagrams of molecular structure, astronomical photographs, MRI images, the many varieties of statistical charts and graphs : These pictorial devices are indispensable tools for presenting evidence, for explaining a theory, for telling a story.}}
  • (mathematics) A diagram displaying data, in particular one showing the relationship between two or more variables; specifically, for a function f(x_1, x_2, \ldots, x_n), the set of all tuples (x_1, x_2, \ldots, x_n, f(x_1, x_2, \ldots, x_n)).
  • (graph theory) An ordered pair (V,E), where V is a set of elements called vertices'' (or ''nodes'') and E is a set of pairs of elements of V, called ''edges ; informally, a set of vertices together with a set edges that join these vertices.
  • (lb) A character, in particular the abstracted fundamental shape of a character as distinct from its ductus (realization in a particular typeface or handwriting: compare glyph).

    • Synonyms

    * (in graph theory) undirected graph * See also

    Hyponyms

    * (in graph theory) tree

    Derived terms

    * acyclic graph * biased graph * biconnected graph * bipartite graph * complete graph * connected graph * directed graph * Eulerian graph * graph articulation * graph centre * graph eccentricity * graph eigenvalue * graph geodesic * graph minor * graph polynomial * graph spectrum * graph thickness * graphic matroid * graphoid * Hamiltonian graph * hypergraph * line graph * multigraph * object graph * Petersen graph * planar graph * pseudograph * random graph * regular graph * signed graph * small world graph * strongly regular graph * subgraph * superregular graph * undirected graph * unicursal graph * voltage graph * weighted graph

    Related terms

    * graphic * graphical * graphism

    Verb

    (en verb)
  • To draw a graph.
  • (mathematics) To draw a graph of a function.

    • Synonyms

    * (draw a graph of) plot, chart

    See also

    * plot * diagram * axis

    Anagrams

    *

    disassortative

    English

    Adjective

    (en adjective)
  • (mathematics) Describing a graph (or network) in which nodes of low degree are more likely to connect with nodes high degree
  • (biology) Not assortative