Граф (математика) бетінің бастапқы мәтінін қарау

[[File:6n-graf.svg|thumb|250px|A [[graph drawing|drawing]] of a [[labeled graph]] on 6 vertices and 7 edges.]]

'''Граф''' - Граф (грекше-жазамын) – төбелер деп аталатын шектеулі нүктелерддің жиынтығы;төберлердің кейбіреулері графтың қырлары деп аталатын сызықтарымен байланысқан болады. Төбелердің  жиыны (v) және реттелмеген және реттелген төбелердің (қырлар мен доғалар) жиынтығы (e) граф болып табылады: Граф “G” (V,E) болып белгілінеді. Тек қырлары ғана қамтитын граф – бағдарланбаған, ал тек доғаларды қамтитыны бағдарланған граф деп аталады. Кез – келген екі төбені қосатын тізбегі болатын граф – байланысқан граф болып табылады.

'''Граф''' — нысандар мен олардың арасындағы байланыстар жиынтығын айтады. Нысандар графтың төбелері деп, ал байланыстар граф қабырғалары деп аталады. Графты қолданылатын саласына байланысты байланыстар саны, қабырғалар бағытымен және төбелеріндегі әртекті қасиеттерімен ажыратады. Көптеген есептерді, нысандарды графтармен сипаттауға болады. Мысалға [[Уикипедия]]ны да графпен сипаттауға болады — төбелері мақалалар, ал қабырғалары — гиперсілтемелер.
=== Граф ===
[[Сурет:Undirected.svg|125px|right]]
'''Граф''', немесе '''бағытталмаған граф''' <math>G</math> — бұл <math>G := (V, E)</math> келесі шарттарды қанағаттандыратын ретті жұптар жиынтығы:
:* <math>V</math> — '''төбелер''' немесе '''түйіндер''' бос емес [[жиын]]ы ;
:* <math>E</math> — '''қабырғалар''' деп аталатын төбелерден құралған жұптар (бағытталмаған графта — ретсіз).
Төбелері мен қабырғаларын кейде граф '''элементтері''' деп те атайды, граф төбелер санын <math>|V|</math> — граф '''дәрежесі''', қабырғалар санын <math>|E|</math> — граф '''өлшемі''' деп атайды.

<math>u</math> және <math>v</math> төбелері <math>e=\{u,v\}</math> қабырғасының '''шеткі''' төбелері (немесе '''шеттері''') деп аталады. Бір қабырғаның екі шеткі төбелері '''көршілес''' деп атады.

Ортақ шеткі төбелері бар екі қабырға '''түйіндес''' деп аталды.

Шеткі төбелер жиыны бірдей болатын екі қабырға '''еселі''' деп аталады.

Шеткі төбелер беттесетін қабырғаны '''ілмек''' аталыды, яғни <math>e=\{v,v\}</math> болса.

<math>V</math> төбесінің '''дәрежесі''' <math>\deg V</math> деп оған тірелетін қабырғалар санын айтады (ілмекті екі рет санайды).

Төбе ешқандай қабырғаның шеті болмаса '''оңашаланған''' болады; ал егер тек қана бір қабырға шеті болса '''салбыраулы''' (немесе '''жапырақ''') болады.
{{clear}}
<!--
is a representation of a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by mathematical abstractions called ''[[Vertex (graph theory)|vertices]]'', and the links that connect some pairs of vertices are called ''edges''.<ref>{{cite book|last=Trudeau|first=Richard J.|title=Introduction to Graph Theory|year=1993|publisher=Dover Pub.|location=New York|isbn=978-0-486-67870-2|pages=19|url=http://store.doverpublications.com/0486678709.html|edition=Corrected, enlarged republication.|accessdate=8 August 2012|quote=A graph is an object consisting of two sets called its ''vertex set'' and its ''edge set''.}}</ref> Typically, a graph is depicted in diagrammatic form as a set of dots 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 is an undirected graph, because if person A shook hands with person B, then person B also shook hands with person A. On the other hand, if the vertices represent people at a party, and there is an edge from person A to person B when person A knows of person B, then this graph is directed, because knowledge of someone is not necessarily a [[symmetric relation]] (that is, one person knowing another person does not necessarily imply the reverse; for example, many fans may know of a celebrity, but the celebrity is unlikely to know of all their fans). This latter type of graph is called a ''directed'' graph and the edges are called ''directed edges'' or ''arcs''.

Vertices are also called ''nodes'' or ''points'', and edges are also called ''lines'' or ''arcs''. Graphs are the basic subject studied by [[graph theory]]. The word "graph" was first used in this sense by [[James Joseph Sylvester|J.J. Sylvester]] in 1878.<ref>{{Cite book
 | title = Handbook of graph theory
 | first1 = Jonathan L.
 | last1 = Gross
 | first2 = Jay
 | last2 = Yellen
 | publisher = [[CRC Press]]
 | year = 2004
 | page = [http://books.google.com/books?id=mKkIGIea_BkC&pg=PA35&lpg=PA35 35]
 | isbn = 978-1-58488-090-5
 | url = http://books.google.com/?id=mKkIGIea_BkC
 | postscript = }}</ref>

==Definitions==
Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures.

===Graph===
[[File:Multigraph.svg|thumb|125px|A general example of a graph (actually, a [[pseudograph]]) with three vertices and six edges.]]
In the most common sense of the term,<ref>See, for instance, Iyanaga and Kawada, '''69 J''', p. 234 or Biggs, p. 4.</ref> a '''graph''' is an [[ordered pair]] ''G''&nbsp;=&nbsp;(''V'',&nbsp;''E'') comprising a [[set (mathematics)|set]] ''V'' of '''vertices''' or '''nodes''' together with a set ''E'' of '''edges''' or '''lines''', which are 2-element subsets of ''V'' (i.e., an edge is related with two vertices, and the relation is represented as [[unordered pair]] of the vertices with respect to the particular edge). To avoid ambiguity, this type of graph may be described precisely as [[graph (mathematics)#Undirected graph|undirected]] and [[graph (mathematics)#Simple graph|simple]]'''.

Other senses of ''graph'' stem from different conceptions of the edge set. In one more generalized notion,<ref>See, for instance, Graham et al., p. 5.</ref> ''E'' is a set together with a relation of '''incidence''' that associates with each edge two vertices. In another generalized notion, ''E'' is a [[multiset]] of unordered pairs of (not necessarily distinct) vertices. Many authors call this type of object a [[multigraph]] or pseudograph.

All of these variants and others are described more fully below.

The vertices belonging to an edge are called the '''ends''', '''endpoints''', or '''end vertices''' of the edge. A vertex may exist in a graph and not belong to an edge.

''V'' and ''E'' are usually taken to be finite, and many of the well-known results are not true (or are rather different) for '''infinite graphs''' because many of the arguments fail in the [[infinite graph|infinite case]]. The '''order''' of a graph is <math>|V|</math> (the number of vertices). A graph's '''size''' is <math>|E|</math>, the number of edges. The '''degree''' of a vertex is the number of edges that connect to it, where an edge that connects to the vertex at both ends (a [[loop (graph theory)|loop]]) is counted twice.

For an edge {''u'',&nbsp;''v''}, graph theorists usually use the somewhat shorter notation ''uv''.
{{-}}

===Adjacency relation===
The edges ''E'' of an undirected graph ''G'' induce a symmetric binary relation ~ on ''V'' that is called the '''adjacency''' relation of ''G''. Specifically, for each edge {''u'',&nbsp;''v''} the vertices ''u'' and ''v'' are said to be '''adjacent''' to one another, which is denoted ''u''&nbsp;~&nbsp;''v''.

==Types of graphs==
===Distinction in terms of the main definition===
As stated above, in different contexts it may be useful to define the term ''graph'' with different degrees of generality. Whenever it is necessary to draw a strict distinction, the following terms are used. Most commonly, in modern texts in graph theory, unless stated otherwise, ''graph'' means "undirected simple finite graph" (see the definitions below).

====Undirected graph====
[[File:Undirected.svg|thumb|125px|A [[Graph (mathematics)#Simple graph|simple]] undirected graph with three vertices and three edges. Each vertex has degree two, so this is also a regular graph.]]

An undirected graph is one in which edges have no orientation. The edge (a, b) is identical to the edge (b, a), i.e., they are not ordered pairs, but sets {''u'',&nbsp;''v''} (or 2-multisets) of vertices.

====Directed graph====
[[File:Directed.svg|125px|thumb|left|A directed graph]]
{{main|Directed graph}}
A '''directed graph''' or '''digraph''' is an ordered pair ''D''&nbsp;=&nbsp;(''V'',&nbsp;''A'') with
* ''V'' a [[set (mathematics)|set]] whose elements are called '''vertices''' or '''nodes''', and
* ''A'' a set of ordered pairs of vertices, called '''arcs''', '''directed edges''', or '''arrows'''.

An arc ''a''&nbsp;=&nbsp;(''x'',&nbsp;''y'') is considered to be directed '''from''' ''x'' '''to''' ''y''; ''y'' is called the '''head''' and ''x'' is called the '''tail''' of the arc; ''y'' is said to be a '''direct successor''' of ''x'', and ''x'' is said to be a '''direct predecessor''' of ''y''. If a [[path (graph theory)|path]] leads from ''x'' to ''y'', then ''y'' is said to be a '''successor''' of ''x'' and '''reachable''' from ''x'', and ''x'' is said to be a '''predecessor''' of ''y''. The arc (''y'',&nbsp;''x'') is called the arc (''x'',&nbsp;''y'') '''inverted'''.

A directed graph ''D'' is called '''symmetric''' if, for every arc in ''D'', the corresponding inverted arc also belongs to ''D''. A symmetric loopless directed graph ''D''&nbsp;=&nbsp;(''V'',&nbsp;''A'') is equivalent to a simple undirected graph ''G''&nbsp;=&nbsp;(''V'',&nbsp;''E''), where the pairs of inverse arcs in ''A'' correspond 1-to-1 with the edges in ''E''; thus the edges in ''G'' number |''E''| = |''A''|/2, or half the number of arcs in ''D''.

A variation on this definition is the '''oriented graph''', in which at most one of (''x'',&nbsp;''y'') and (''y'',&nbsp;''x'') may be arcs.

====Mixed graph====
A '''mixed graph''' ''G'' is a graph in which some edges may be directed and some may be undirected.
It is written as an ordered triple ''G''&nbsp;=&nbsp;(''V'',&nbsp;''E'',&nbsp;''A'') with ''V'', ''E'', and ''A'' defined as above.
Directed and undirected graphs are special cases.

====Multigraph====
A [[loop (graph theory)|loop]] is an edge (directed or undirected) which starts and ends on the same vertex; these may be permitted or not permitted according to the application. In this context, an edge with two different ends is called a '''link'''.

The term "[[multigraph]]" is generally understood to mean that [[multiple edges]] (and sometimes loops) are allowed. Where graphs are defined so as to ''allow'' loops and multiple edges, a multigraph is often defined to mean a graph ''without'' loops,<ref>For example, see Balakrishnan, p. 1, Gross (2003), p. 4, and Zwillinger, p. 220.</ref> however, where graphs are defined so as to ''disallow'' loops and multiple edges, the term is often defined to mean a "graph" which can have both multiple edges ''and'' loops,<ref>For example, see. Bollobás, p. 7 and Diestel, p. 25.</ref> although many use the term "[[pseudograph]]" for this meaning.<ref>Gross (1998), p. 3, Gross (2003), p. 205, Harary, p.10, and Zwillinger, p. 220.</ref>

====Quiver====

A '''[[Quiver (mathematics)|quiver]]''' or "multidigraph" is a directed graph which may have more than one arrow from a given source to a given target. A quiver may also have directed loops in it.

====Simple graph====
As opposed to a multigraph, a simple graph is an undirected graph that has no [[Loop (graph theory)|loops]] and no more than one edge between any two different vertices. In a simple graph the edges of the graph form a set (rather than a [[multiset]]) and each edge is a ''distinct'' pair of vertices. In a simple graph with ''n'' vertices every vertex has a degree that is less than ''n'' (the converse, however, is not true&nbsp;— there exist non-simple graphs with ''n'' vertices in which every vertex has a degree smaller than ''n'').

====Weighted graph====
A graph is a [[weighted graph]] if a number (weight) is assigned to each edge.<ref>{{cite book|last1=Fletcher|first1=Peter|last2=Hoyle|first2=Hughes|last3=Patty|first3=C. Wayne|title=Foundations of Discrete Mathematics|year=1991|publisher=PWS-KENT Pub. Co.| location=Boston| isbn=0-53492-373-9| pages=463 | edition=International student ed.|quote=A '''weighted graph''' is a graph in which a number ''w(e)'', called its '''weight''', is assigned to each edge ''e''.}}</ref>  Such weights might represent, for example, costs, lengths or capacities, etc. depending on the problem at hand. Some authors call such a graph a network.<ref>{{Citation | last=Strang | first=Gilbert | title=Linear Algebra and Its Applications | publisher=Brooks Cole | edition=4th | year=2005 | isbn=0-03-010567-6 | url=http://books.google.com/books?vid=ISBN0030105676 }}</ref>

====Half-edges, loose edges====
In exceptional situations it is even necessary to have edges with only one end, called '''half-edges''', or no ends ('''loose edges'''); see for example [[signed graph]]s and [[biased graph]]s.

===Important graph classes===
====Regular graph====
{{main|Regular graph}}
A regular graph is a graph where each vertex has the same number of neighbors, i.e., every vertex has the same degree or valency. A regular graph with vertices of degree ''k'' is called a ''k''‑regular graph or regular graph of degree ''k''.

====Complete graph====
[[File:Complete graph K5.svg|thumb|125px|A complete graph with 5 vertices. Each vertex has an edge to every other vertex.]]
{{Main|Complete graph}}
Complete graphs have the feature that each pair of vertices has an edge connecting them.

====Finite and infinite graphs====
A finite graph is a graph ''G''&nbsp;=&nbsp;(''V'',&nbsp;''E'') such that ''V'' and ''E'' are [[finite set]]s. An infinite graph is one with an [[Infinite set|infinite]] set of vertices or edges or both.

Most commonly in graph theory it is implied that the graphs discussed are finite. If the graphs are infinite, that is usually specifically stated.

====Graph classes in terms of connectivity====
{{main|Connectivity (graph theory)}}

In an undirected graph ''G'', two [[vertex (graph theory)|vertices]] ''u'' and ''v'' are called '''connected''' if ''G'' contains a [[Path (graph theory)|path]] from ''u'' to ''v''. Otherwise, they are called '''disconnected'''. A graph is called '''connected''' if every pair of distinct vertices in the graph is connected; otherwise, it is called '''disconnected'''.

A graph is called [[K-vertex-connected graph|'''''k''-vertex-connected''']] or [[k-edge-connected graph|'''''k''-edge-connected''']] if no set of ''k-1'' vertices (respectively, edges) exists that, when removed, disconnects the graph. A ''k''-vertex-connected graph is often called simply '''''k''-connected'''.

A [[directed graph]] is called '''weakly connected''' if replacing all of its directed edges with undirected edges produces a connected (undirected) graph. It is '''strongly connected''' or '''strong''' if it contains a directed path from ''u'' to ''v'' and a directed path from ''v'' to ''u'' for every pair of vertices ''u'',&nbsp;''v''.

==Properties of graphs==
{{see also|Glossary of graph theory|Graph property}}

Two edges of a graph are called '''adjacent''' (sometimes '''coincident''') if they share a common vertex. Two arrows of a directed graph are called '''consecutive''' if the head of the first one is at the nock (notch end) of the second one. Similarly, two vertices are called '''adjacent''' if they share a common edge ('''consecutive''' if they are at the notch and at the head of an arrow), in which case the common edge is said to '''join''' the two vertices. An edge and a vertex on that edge are called '''incident'''.

The graph with only one vertex and no edges is called the '''trivial graph'''. A graph with only vertices and no edges is known as an '''edgeless graph'''. The graph with no vertices and no edges is sometimes called the '''null graph''' or '''empty graph''', but the terminology is not consistent and not all mathematicians allow this object.

In a '''weighted''' graph or digraph, each edge is associated with some value, variously called its ''cost'', ''weight'', ''length'' or other term depending on the application; such graphs arise in many contexts, for example in [[Shortest path problem|optimal routing problem]]s such as the [[traveling salesman problem]].

Normally, the vertices of a graph, by their nature as elements of a set, are distinguishable. This kind of graph may be called '''vertex-labeled'''. However, for many questions it is better to treat vertices as indistinguishable; then the graph may be called '''unlabeled'''. (Of course, the vertices may be still distinguishable by the properties of the graph itself, e.g., by the numbers of incident edges). The same remarks apply to edges, so graphs with labeled edges are called '''edge-labeled''' graphs. Graphs with labels attached to edges or vertices are more generally designated as '''labeled'''. Consequently, graphs in which vertices are indistinguishable and edges are indistinguishable are called ''unlabeled''. (Note that in the literature the term ''labeled'' may apply to other kinds of labeling, besides that which serves only to distinguish different vertices or edges.)

==Examples==
[[File:6n-graf.svg|thumb|A graph with six nodes.]]
* The diagram at right is a graphic representation of the following graph:
: ''V'' = {1, 2, 3, 4, 5, 6}
: ''E'' = {{1,&nbsp;2}, {1,&nbsp;5}, {2,&nbsp;3}, {2,&nbsp;5}, {3,&nbsp;4}, {4,&nbsp;5}, {4,&nbsp;6}}.
* In [[category theory]] a [[category (mathematics)|small category]] can be represented by a directed [[multigraph]] in which the objects of the category represented as vertices and the [[morphism]]s as directed edges. Then, the [[functor]]s between categories induce some, but not necessarily all, of the [[digraph morphism]]s of the graph.
* In [[computer science]], directed graphs are used to represent knowledge (e.g., [[Conceptual graph]]), [[finite state machine]]s, and many other discrete structures.
* A [[binary relation]] ''R'' on a set ''X'' defines a directed graph. An element ''x'' of ''X'' is a direct predecessor of an element ''y'' of ''X'' iff ''xRy''.

==Important graphs==
Basic examples are:
* In a [[complete graph]], each pair of vertices is joined by an edge; that is, the graph contains all possible edges.
* In a [[bipartite graph]], the vertex set can be [[Partition of a set|partitioned]] into two sets, ''W'' and ''X'', so that no two vertices in ''W'' are adjacent and no two vertices in ''X'' are adjacent. Alternatively, it is a graph with a [[chromatic number]] of 2.
* In a [[complete bipartite graph]], the vertex set is the union of two disjoint sets, ''W'' and ''X'', so that every vertex in ''W'' is adjacent to every vertex in ''X'' but there are no edges within ''W'' or ''X''.
* In a ''linear graph'' or [[path graph]] of length ''n'', the vertices can be listed in order, ''v''<sub>0</sub>, ''v''<sub>1</sub>, ..., ''v''<sub>n</sub>, so that the edges are ''v''<sub>i−1</sub>''v''<sub>i</sub> for each ''i'' = 1, 2, ..., ''n''. If a linear graph occurs as a [[Glossary of graph theory#Subgraphs|subgraph]] of another graph, it is a [[Path (graph theory)|path]] in that graph.
* In a [[cycle graph]] of length ''n ≥ 3'', vertices can be named ''v''<sub>1</sub>, ..., ''v''<sub>n</sub> so that the edges are ''v''<sub>i−1</sub>''v''<sub>''i''</sub> for each ''i'' = 2,...,''n'' in addition to ''v''<sub>n</sub>''v''<sub>1</sub>. Cycle graphs can be characterized as [[Connectivity (graph theory)|connected]] [[Regular graph|2-regular]] graphs. If a cycle graph occurs as a subgraph of another graph, it is a ''cycle'' or ''circuit'' in that graph.
* A [[planar graph]] is a graph whose vertices and edges can be drawn in a plane such that no two of the edges intersect (i.e., ''embedded'' in a plane).
* A [[tree (graph theory)|tree]] is a connected graph with no cycles.
* A ''forest'' is a graph with no cycles (i.e. the disjoint union of one or more ''trees'').

More advanced kinds of graphs are:
* The [[Petersen graph]] and its generalizations
* [[Perfect graph]]s
* [[Cograph]]s
* [[Chordal graph]]s
* Other graphs with large [[Graph automorphism|automorphism groups]]: [[Vertex-transitive graph|vertex-transitive]], [[Arc-transitive graph|arc-transitive]], and [[distance-transitive graph]]s.
* [[Strongly regular graph]]s and their generalization [[distance-regular graph]]s.

==Operations on graphs==
{{main|Operations on graphs}}

There are several operations that produce new graphs from old ones, which might be classified into the following categories:
* Elementary operations, sometimes called "editing operations" on graphs, which create a new graph from the original one by a simple, local change, such as addition or deletion of a vertex or an edge, merging and splitting of vertices, etc.
* [[graph rewriting|Graph rewrite operations]] replacing the occurrence of some pattern graph within the host graph by an instance of the corresponding replacement graph.
* Unary operations, which create a significantly new graph from the old one. Examples:
** [[Line graph]]
** [[Dual graph]]
** [[Complement graph]]
* Binary operations, which create new graph from two initial graphs. Examples:
** [[Disjoint union of graphs]]
** [[Cartesian product of graphs]]
** [[Tensor product of graphs]]
** [[Strong product of graphs]]
** [[Lexicographic product of graphs]]

==Generalizations==
In a [[hypergraph]], an edge can join more than two vertices.

An undirected graph can be seen as a [[simplicial complex]] consisting of 1-[[simplex|simplices]] (the edges) and 0-simplices (the vertices). As such, complexes are generalizations of graphs since they allow for higher-dimensional simplices.

Every graph gives rise to a [[matroid]].

In [[model theory]], a graph is just a [[structure (model theory)|structure]]. But in that case, there is no limitation on the number of edges: it can be any [[cardinal number]], see [[continuous graph]].

In [[computational biology]], [[power graph analysis]] introduces power graphs as an alternative representation of undirected graphs.

In [[geographic information systems]], [[geometric networks]] are closely modeled after graphs, and borrow many concepts from [[graph theory]] to perform spatial analysis on road networks or utility grids.
-->
==Тағы қараңыз==
<!--* [[Dual graph]]
* [[Glossary of graph theory]]
* [[Hypergraph]]
* [[Graph (data structure)]]
* [[Graph database]]
* [[Graph drawing]]
* [[List of publications in mathematics#Graph theory|Graph theory publications]]
* [[List of graph theory topics]]
* [[Network theory]]
* [[Webgraph]]
* [[Conceptual graph]]
* [[Horizontal constraint graph]]
* [[Causal dynamical triangulation]]
* [[Sage Math]] (software)
* [[NetworkX]] (software)
* [[Mathematica]] (software)-->
* [[Графтар теориясы]]

==Нұсқа==
{{reflist}}

==Сілттемелер==
* {{cite book|last=Balakrishnan|first=V. K.|title=Graph Theory|publisher=McGraw-Hill|date=1997-02-01|edition=1st|isbn=0-07-005489-4}}
* {{cite book|last=Berge|first=Claude|title=Théorie des graphes et ses applications|publisher=Collection Universitaire de Mathématiques, II|location=Dunod, Paris|year=1958|pages=viii+277|language=French|authorlink=Claude Berge}} Translation: {{cite book|publisher=Wiley|location=Dover, New York|year=2001|origyear=1962}}
* {{cite book|last=Biggs|first=Norman|title=Algebraic Graph Theory|publisher=Cambridge University Press|year=1993|edition=2nd|isbn=0-521-45897-8}}
* {{cite book|last=Bollobás|first=Béla|title=Modern Graph Theory|publisher=Springer|date=2002-08-12|edition=1st|isbn=0-387-98488-7}}
* {{cite book|last=Bang-Jensen|first=J.|coauthors=Gutin, G.|title=Digraphs: Theory, Algorithms and Applications|publisher=Springer|year=2000|url=http://www.cs.rhul.ac.uk/books/dbook/}}
* {{Cite book | last1=Diestel | first1=Reinhard | title=Graph Theory | url=http://diestel-graph-theory.com/GrTh.html | publisher=Springer-Verlag | location=Berlin, New York | edition=3rd | isbn=978-3-540-26183-4 | year=2005 | postscript= }}.
* {{cite book|title=Handbook of Combinatorics|editor=Graham, R.L., Grötschel, M., and Lovász, L|publisher=MIT Press|year=1995|isbn=0-262-07169-X}}
* {{cite book|last=Gross|first=Jonathan L.|coauthors=Yellen, Jay|title=Graph Theory and Its Applications|publisher=CRC Press|date=1998-12-30|isbn=0-8493-3982-0}}
* {{cite book|title=Handbook of Graph Theory|editor=Gross, Jonathan L., & Yellen, Jay|publisher=CRC|date=2003-12-29|isbn=1-58488-090-2}}
* {{cite book|last=Harary|first=Frank|title=Graph Theory|publisher=Addison Wesley Publishing Company|date=January 1995|isbn=0-201-41033-8}}
* {{cite book|last=Iyanaga|first=Shôkichi|coauthors=Kawada, Yukiyosi|title=Encyclopedic Dictionary of Mathematics|publisher=MIT Press|year=1977|isbn=0-262-09016-3}}
* {{cite book|last=Zwillinger|first=Daniel|title=CRC Standard Mathematical Tables and Formulae|publisher=Chapman & Hall/CRC|date=2002-11-27|edition=31st|isbn=1-58488-291-3}}

==Арғы оқылымдар==
*{{cite book|last=Trudeau|first=Richard J.|title=Introduction to Graph Theory|year=1993|publisher=[[Dover Publications]]|location=New York|isbn=978-0-486-67870-2|url=http://store.doverpublications.com/0486678709.html|edition=Corrected, enlarged republication.|accessdate=8 August 2012}}

==Сыртқы сілттемелер==
* [http://www.gfredericks.com/main/sandbox/graphs A searchable database of small connected graphs]
* [http://www.visualcomplexity.com VisualComplexity.com] — A visual exploration on mapping complex networks
* {{MathWorld | urlname=Graph | title = Graph}}
* [https://sourceforge.net/projects/igv-intelligent/ Intelligent Graph Visualizer] — IGV create and edit graph, automatically places graph, search shortest path (+coloring vertices), center, degree, eccentricity, etc.
* [http://code.google.com/p/vge2/ Visual Graph Editor 2] — VGE2 designed for quick and easy creation, editing and saving of graphs and analysis of problems connected with graphs.
* [http://gianlucacosta.info/software/graphsj/ GraphsJ] — GraphsJ is an open source didactic Java software which features an easy-to-use GUI and interactively solves step-by-step many graph problems. Extensible via its Java SDK.
* [http://graphclasses.org GraphClasses] — Information System on Graph Classes and their Inclusions.
* [http://graphtheorysoftware.com/ Graph Theory Software]

==Дереккөздер==
Математика әлемі

{{DEFAULTSORT:Graph (Mathematics)}}
[[Санат:Математика]]
[[Санат:Графтар теориясы]]