Graph property in the context of Graph (discrete mathematics)


Graph property in the context of Graph (discrete mathematics)

Graph property Study page number 1 of 1

Play TriviaQuestions Online!

or

Skip to study material about Graph property in the context of "Graph (discrete mathematics)"


⭐ Core Definition: Graph property

In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations such as particular labellings or drawings of the graph.

↓ Menu
HINT:

In this Dossier

Graph property in the context of Discrete mathematics

Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a one-to-one correspondence (bijection) with natural numbers), rather than "continuous" (analogously to continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets (finite sets or sets with the same cardinality as the natural numbers). However, there is no exact definition of the term "discrete mathematics".

The set of objects studied in discrete mathematics can be finite or infinite. The term finite mathematics is sometimes applied to parts of the field of discrete mathematics that deal with finite sets, particularly those areas relevant to business.

View the full Wikipedia page for Discrete mathematics
↑ Return to Menu