. . . : . - , , . , :
- ( r )
. .
(E.Dijkstra)
() () () (|V| ), . 1959 .
(J.B.Kruskal)
1. . 2. , . .. .
(R.C.Prim)
( ) (.. , ) . .. .
- (S.M.Roberts, B.Flores)
, .
(Fleury)
.
(R.W.Floyd)
.
(Anti-symmetric graph)
, : (v ,v ) , (v ,v ). , .. .
(Cycle basis)
, . .. , . . . .
(Unbounded face)
. .
, .
(Binary tree)
, , , . , : , , , .
. .. , . . m - .
|
|
(Bichromatic graph)
, 2. .
(Value of a flow)
, . , .
(Value of a cut)
. .
(Vertex)
, , ; , ( ) - , , . , .
, a (Reachible from a vertex)
, a .
(Isolated vertex)
( ), . 0.
, (Vertex incident to an edge)
.
. .
(Terminal vertex)
a b, e = (a,b); b e = (a,b); .
(Central vertex)
, ; .
(Weight of an arc)
, , , . . . .
(Weighted graph)
(), () . (G,w), w , .
(Terminal(pendant) vertex)
1. 1.
2. , 1, , 0.
.
(Inner vertex)
, , .. .
( ) (Height of vertex)
- .
(Height of tree)
().
(Hamiltonian graph)
, , . , ., ., ., . . , , . "" ., 1859 . " ", .
(Hamiltonian cycle)
, .
(Hamiltonian directed graph)
, , . .
|
|
(Hamiltonian path)
, .
(Geodetic chain)
(v,w) -. . .
(Graph colouring conjecture)
4-. : , . , . , 1840 ., , 1850 . . 1879 . , . "" 1879. , 1976. .
(Depth of a vertex)
.
(Homeomorphical graphs)
, . , .
(Face, facet)
, , . . , , ; .
( ) (Graph (undirected graph)
1. (V,E), V , , E V, . G V(G) E(G), . |V(G)| = n |E(G)| = m, (n,m) - G. 2. (V,E), V , E V / , V = {(v,w) | v w } :
(v ,w ) (v ,w ) (v ,w ) = (v ,w ) (v ,w ) = (w ,v )
3. (V,E,P), V , E , , , P , e E v w V. 4. , .
(Graphs of Kuratowski)
K K .
(Bipartite graph)
, (), . , , , .
(Cartesian product of graphs)
= H H ... H , H (v,w), v = (v ,..., v ) w = (w ,..., w ), , E = (v , w ),..., E = (v , w ), E H .
(Tree)
.
(Diameter)
.
(Length of a chain)
( ) ; ( ) .
(Edge adding)
, e G, G + e.
|
|
k - (k-partite graph)
, k , . , , , k- K .
(Complementary graph)
G1, , G, , G.
(Reachable vertex)
w v, v w.
(Reaching set)
, .
(Reachability)
R , aRb , a b.
(Arc)
; (v,w) , , v w .
(Graph representation)
, ; , , . , .
(Chinese postman's problem)
, , ( , ) . , .
(Traveling salesman problem)
n , . , . : ( ) ().
NP-; . , ; .
(Koenigsberg's bridges problem)
( ) , . 1736 . : , ?
(Cycle)
(), .
.
(Starred graph)
K ; n = 3 "" "".
(Graph isomorphism)
: V(G) V(H) G H, ; , u v G (u) (v) H , u v G.
, .. , . , , , . NP- .
(Isomorphic graphs)
, ; , G H (G H), G H (, , H G.
|
|
(Incidenty)
() , .. e = (a,b) a b a, b e = (a,b).
(Source)
1. , .
2. , .
3. , , .
(Spanning tree)
. , , , .
(Clique)
V' G, , .. G(V') .
(Clique number)
(G) .
, .
(Code of a tree)
, , . , , , , , , , , , .
(Cotree)
) T G, G, T;
) G T.
(Root)
( ).
(Rooted tree)
.
(Multiplicity of edge)
, .
(Multiple arcs)
, .
(Multiple edges)
, .
(Shortest spanning tree)
() .
(Shortest path)
, .
(Cubic graph)
3.
(Left linear tree)
, :
) ..;
) , , .., ..
(Handshake's lemma)
, .
- : , ( , ). .
(Forest)
. .
(Leaf)
1. , . 2. .
(Sequence)
a = v , e , v , e ,..., v , e , v = b
, e = (v ,v ), 1 i n. , a b . , a = v , v ,..., v = b e , e ,..., e . . , , . ., (a b), - ; . - .
(Weight matrix)
, n n (n ), (i,j) - / (v , v ), ; (i,j) - .
(Reachibility matrix)
(0,1)- R(G) n n (n G), (i,j) - r 1, G v v ( v v ), 0 .
((vertex-edge) incidence matrix)
(0,1)- I(G) n m (n , m / G), (i,j) - 1, v e v e , -1, v e ( ), 0 .
.
|
|
(Kirchhoff's matrix)
(0,1)- B(G) n n (n G), (i,j) - b -1, v v (i j), deg v v i = j 0 . .
(Adjacency matrix, vertex incidence matrix)
(0,1)- A(G) n n (n G), (i,j) - a 1, v v , .. ( ) (v , v ), 0 . .. . .. (i,j) - , v v ( ).
.. (, , ) .
(Fundamental cut-set matrix)
, .
(Fundamental cycle matrix)
, .
(Matrix-tree theorem)
, 1847 . :
G n 2 B(G).
n - ( n ).
(Minimal flow)
, .
(Bridge)
, ; .
.
(Multigraph)
(V,E), V , E V V (); , .
(Supergraph)
.
(Maximum flow)
, . - .
(Girth)
. , 0, , .
(Graphs union)
, F G H V(H) = V(F) V(G) E(H) = E(F) E(G). H = F G. , V(F) V(G) = .
.
, .
(Circumference of a graph)
.
.
(Directed tree)
, .
(Directed graph)
(V,A), V , A ( ), A V .
(Directed sequence)
S = (v , e , v , e ,..., e , v ) v e , e = (v , v ), 1 i n. (v , v ) -. v v , .
(Intersection of graphs)
G = G G , , .
(Graph enumeration)
( ).
(Loop)
(v,v), v V(G), . , , , .
(Planar graph)
, , , . , , .
(Planar graph)
, , , .
. .
(Subgraph)
1. G = (V,E) H = (W,U), W G, W V, / U / E, U E, (x,y) E x,y W, (x,y) U. . . .
2. , . ; .
(Subdivision of an edge)
, e = (x,y) e = (x,z) e = (z,y), z 2. . .
(Depth first search)
() , ( ) , , ( ), , , s, . s ; : , , , . , , ; . , M-. , . : , , - , , , , , . , , ( ), , . . - , .
(Width (breadth) first search)
: s 0, 1. 1 2 .. , . (i,i+1) , , . , , 1, 2 ..
(Complete graph)
, .
n - K .
(Complete bipartite graph)
, , , .
k - (Complete k-partite graph)
k - , , , .
(Semihamiltonian graph)
, , . .
(Indegree)
, .
(Outdegree)
, .
(Semieuler graph)
, , . .
(Labeled graph)
, , 1, 2,..., n - .
(Induced subgraph)
, , ; , , .
(Order of a graph)
.
(Flow)
f(e), E :
1) 0 r(e) f(e) c(e), e E;
2) .
3)
4) r(e) e, c(e) .
s , t , . , , . . -:
.
(Descendent of a vertex)
v w, v; w v, (v,w). v.
(Proper (vertex) colouring)
, ( ) .
(Predecessor of a vertex)
w v, w; v ( ), (v,w); w.
(Simple cycle)
, .
(Simple path)
, .
(Simple cutset)
, .
(Simple circuit)
, .
(Empty graph)
, . , 0 .
(Path)
S = (v , e , v ,..., e , v ), e = (v , v ) i = 1,..., n; ; v v n v , v v ,..., v .
(Radius of a graph)
; , .
(Cut-set)
, .
(Cut-vertex (cutting vertex)) x G , V(G) \ { x } V' V'', G.
. .
(Colouring)
G k f: V(G) { 1,2,...,k }, . , , k - k -. , . . f , k - k . , k - G k , .
(Colored graph)
, .
k - (k-colored graph)
k .
k - (k-colourable map)
, k , (.. ) .
k - (k-colourable graph)
, k -.
k - (Edge k-colouring)
, e (e) {1,2,..., k };
1) (e) = c, , e c;
2) , .
(Edge colourable graph)
, .
k - (Edge k-colourable graph)
, k -.
- (Line-chromatic number, edge chromatic number})
G L(G).
(Line (edge) graph)
G L(G), G L(G) , G.
(Regular graph)
, ; . ; . n n - .
.
(Self-complementary graph)
, .
, , 4- 5- .
(Connected verticies)
, .
(Connectivity)
, .
.
(Connected component of a graph)
; .
(Connected graph)
, () , .. , .
k - (k-connected graph)
, () k.
(Net, network)
, , . , . .
(Cutting set, cutset, separating set)
, .
(Strongly connected graph)
, .
(Symmetric directed graph)
, .
(Weakly connected graph)
, ().
.
(Adjacent vertices, joined vertices)
a b, ( ), (a,b) ( ), ( ).
(Adjacent faces)
, .
(Adjacent arcs)
, .
(Adjacent edges)
, ( ) ( ).
(Adjacency)
Ad () , a Ad b , a b ( ).
(Mixed graph)
, , .
(Graphs union)
G G V V
G + G = G G K(V ,V ), K(V ,V ) V V .
(Edge list)
(), ().
(Adjacency list)
v , v; n , .
(Degree of a vertex, valency of a vertex)
; , .. .
(Degree of a graph)
.
.
(Contraction of a graph)
.
(Contraction of an edge)
(u,v) u v .
(Spanning subgraph)<