overview of Mathgraph
description::
· math-graph is a-set of abstract-entities[a] and relations among them[a].
name::
* McsEngl.McsEdu000003.last.html//dirEdu//dirMcs!⇒Mathgraph,
* McsEngl.dirMcs/dirEdu/McsEdu000003.last.html!⇒Mathgraph,
* McsEngl.Mathgraph, /máthgráf/,
* McsEngl.Mathgraph!=McsEdu000003,
* McsEngl.Mathgraph!=mathematical-graph,
* McsEngl.graph!⇒Mathgraph,
* McsEngl.math-graph!⇒Mathgraph,
* McsEngl.mathematical-graph!⇒Mathgraph,
descriptionLong::
· In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line).[1] Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics.
The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person A can shake hands with a person B only if B also shakes hands with A. In contrast, if any edge from a person A to a person B corresponds to A owes money to B, then this graph is directed, because owing money is not necessarily reciprocated. The former type of graph is called an undirected graph while the latter type of graph is called a directed graph.
Graphs are the basic subject studied by graph theory. The word "graph" was first used in this sense by James Joseph Sylvester in 1878.[2][3]
[{2021-02-06} https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)]
01_node of Mathgraph
description::
· abstract-entity is an-entity without specific referent.
name::
* McsEngl.Grphnode,
* McsEngl.Mathgraph'abstract-entity!⇒Grphnode,
* McsEngl.Mathgraph'dot!⇒Grphnode,
* McsEngl.Mathgraph'node!⇒Grphnode,
* McsEngl.Mathgraph'vertex!⇒Grphnode,
* McsEngl.abstract-entity-of-graph!⇒Grphnode,
* McsEngl.graph-node!⇒Grphnode,
* McsEngl.dot-of-graph!⇒Grphnode,
* McsEngl.node-of-graph!⇒Grphnode,
* McsEngl.vertex-of-graph!⇒Grphnode,
02_line of Mathgraph
description::
· graph-line is a-relation between two graph-nodes.
name::
* McsEngl.Grphline,
* McsEngl.Mathgraph'arch!⇒Grphline,
* McsEngl.Mathgraph'edge!⇒Grphline,
* McsEngl.Mathgraph'line!⇒Grphline,
* McsEngl.Mathgraph'relation!⇒Grphline,
* McsEngl.arch-of-graph!⇒Grphline,
* McsEngl.edge-of-graph!⇒Grphline,
* McsEngl.graph-line!⇒Grphline,
* McsEngl.relation-of-graph!⇒Grphline,
order of Mathgraph
description::
· the-number of graph-nodes.
name::
* McsEngl.Mathgraph'order,
size of Mathgraph
description::
· the-number of graph-lines.
name::
* McsEngl.Mathgraph'size,
degree of Mathgraph
description::
· the-average lines of a-node.
name::
* McsEngl.Mathgraph'degree,
graph-theory of Mathgraph
description::
× generic: mathDiscrete,
· graph-theory is the-theory of graphs.
name::
* McsEngl.Mathgraph'theory,
* McsEngl.graph-theory,
* McsEngl.sciMath.008-graph-theory,
* McsEngl.sciMath.graph-theory,
descriptionLong::
"In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically; see Graph (discrete mathematics) for more detailed definitions and for other variations in the types of graph that are commonly considered. Graphs are one of the prime objects of study in discrete mathematics.
Refer to the glossary of graph theory for basic definitions in graph theory."
[{2021-02-06} https://en.wikipedia.org/wiki/Graph_theory]
techInfo of Mathgraph
description::
* http://www.graphtheorysoftware.com/,
name::
* McsEngl.Mathgraph'techInfo,
relation-to-network (link) of Mathgraph
info-resource of Mathgraph
name::
* McsEngl.Mathgraph'resource,
addressWpg::
*
structure of Mathgraph
name::
* McsEngl.Mathgraph'structure,
description::
*
DOING of Mathgraph
name::
* McsEngl.Mathgraph'doing,
description::
*
evoluting of Mathgraph
name::
* McsEngl.evoluting-of-Mathgraph,
* McsEngl.Mathgraph'evoluting,
{2021-02-06}::
=== McsHitp-creation:
· creation of current concept.
WHOLE-PART-TREE of Mathgraph
name::
* McsEngl.Mathgraph'whole-part-tree,
whole-tree-of-Mathgraph::
*
* ... Sympan.
part-tree-of-Mathgraph::
*
GENERIC-SPECIFIC-TREE of Mathgraph
name::
* McsEngl.Mathgraph'generic-specific-tree,
generic-tree-of-Mathgraph::
* ,
* ... entity.
specific-tree-of-Mathgraph::
* ,
Mathgraph.bipartite-001
description::
"In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets {\displaystyle U}U and {\displaystyle V}V such that every edge connects a vertex in {\displaystyle U}U to one in {\displaystyle V}V. Vertex sets {\displaystyle U}U and {\displaystyle V}V are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.[1][2]"
[{2021-02-06} https://en.wikipedia.org/wiki/Bipartite_graph]
name::
* McsEngl.Mathgraph.001-bipartite!⇒grphBipt, /báipártait/,
* McsEngl.Mathgraph.bipartite!⇒grphBipt,
* McsEngl.bigraph!⇒grphBipt,
* McsEngl.bipartite-graph!⇒grphBipt,
* McsEngl.grphBipt,
* McsEngl.grphBipt'(bipartite-graph!⇒grphBipt,
