Graph Theory Glossary

Graafiteooria sõnastik – Graph Theory Glossary

| # | a | b | c-cn | co | cp-cz | d | e | f | g | h | i | j | k | l | m-mh | mi | mj-mz |
| n | o | p | q | r | s-so | sp-sz | t | u | v | w | xyz |

Hadwiger conjecture A k-chromatic graph has a subgraph contractible to K_k (true for "almost all" graphs). [DW96]	Hadwigeri hüpotees k-värvilisel graafil on graafiks K_k ahendatav alamgraaf (kehtib "peaaegu kõigi" graafide puhul).
Hadwiger number The smallest number k for which some component of the graph can be contracted to the complete graph K_k . [BW97]	Hadwigeri arv Vähim arv k , mille puhul saab graafi mõne komponendi ahendada täielikuks graafiks K_k .
Hajos conjecture A k-chromatic graph contains a homeomorph of K_k (false beyond k = 5). [DW96]	Hajosi hüpotees k-värviline graaf sisaldab graafi K_k homeomorfi (ei kehti k ³ 5 puhul).
Hajós number The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k . [EW00]	Hajósi arv Graafi G Hajósi arv h(G) on maksimaalne k , nii et G sisaldab täieliku graafi K_k alajaotust.
half edge Edge with one end, thus one endpoint. [TZ98] FIGURE	poolserv Ühe otspunktiga serv. JOONIS
Hall's theorem A necessary and sufficient condition for the existence of a system of distinct representatives. [DW96]	Halli teoreem Tarvilik ja piisav tingimus erinevate esindajate süsteemi olemasoluks.
Hamiltonian anticycle A spanning semicycle of a digraph D containing no subpath of length 2. [CL96]	Hamiltoni antitsükkel Orienteeritud graafi D kattev pooltsükkel, mis ei sisalda alamteed pikkusega 2.
Hamiltonian chain = Hamiltonian path	Hamiltoni ahel = Hamiltoni tee
Hamiltonian circuit = Hamiltonian cycle	Hamiltoni tsükkel
Hamiltonian circuit problem = Hamiltonian cycle problem	Hamiltoni tsükli ülesanne
Hamiltonian closure Graph obtained by successfully adding edges between vertices whose degree-sum is as large as the number of vertices. [DW96]	Hamiltoni sulund Graaf, mis saadakse servade lisamisel tippude vahele, mille astmete summa võrdub tippude arvuga.
Hamiltonian completion problem Given a graph G = (V, E) and non-negative integer K £ \| V \| , is there a superset E ' containing E such that \| E – E ' \| £ K and the graph G ' = (V, E ' ) has a Hamiltonian circuit? [GJ79]	Hamiltoni täiendamise ülesanne Antud on graaf G = (V, E) ja mittenegatiivne täisarv K £ \| V \| . Kas leidub hulka E sisaldav ülemhulk E ' , nii et \| E – E ' \| £ K ja graafil G ' = (V, E ' ) on Hamiltoni tsükkel?
Hamiltonian cycle = Hamiltonian circuit A graph cycle (i.e. closed loop) through a graph that visits each node exactly once. The Hamiltonian circuit is named after Sir William Rowan Hamilton, who devised a puzzle in which such a path along the edges of an icosahedron was sought (the Icosian game). [EW00] A cycle that includes each vertex of the directed graph exactly once. [CGM79] Elementary cycle that includes each vertex of a graph exactly once. FIGURE	Hamiltoni tsükkel Tsükkel (st suletud tee) graafis, mis läbib iga tippu täpselt ühe korra. Hamiltoni tsükkel on saanud oma nime Sir William Rowan Hamiltoni järgi, kes kavandas mõistatusmängu (Icosia mängu), kus otsiti sellist teed ikosaeedri servadel. Tsükkel, mis sisaldab orienteeritud graafi iga tippu täpselt ühe korra. Elementaartsükkel, mis läbib graafi iga tippu täpselt üks kord. [OO76] JOONIS
Hamiltonian cycle problem = Hamiltonian circuit problem Given a graph G = (V, E) , does G contain a Hamiltonian circuit? [GJ79]	Hamiltoni tsükli ülesanne Antud on graaf G = (V, E) . Kas G sisaldab Hamiltoni tsüklit?
Hamiltonian factorization A factorization of G such that every factor is a Hamiltonian cycle of G . [CL96]	Hamiltoni faktoriseerimine Graafi G faktoriseerimine, nii et iga tegur on graafi G Hamiltoni tsükkel
Hamiltonian graph A graph possessing a Hamiltonian circuit. By convention, the trivial graph on a single node is considered Hamiltonian, but the connected graph on two nodes is not. [EW00] A graph G is Hamiltonian if it has a cycle that includes every vertex of G . [BW97] FIGURE	Hamiltoni graaf Hamiltoni tsüklit omav graaf. Kokkuleppeliselt käsitletakse triviaalset ühe tipuga graafi Hamiltoni graafina, kahe tipuga sidusat graafi aga mitte . Graaf G on Hamiltoni graaf, kui ta sisaldab graafi G iga tippu läbivat tsüklit. JOONIS
Hamiltonian path = Hamiltonian chain A path that includes every vertex of G. [BW97] Elementary chain that connects two vertices of the graph and includes all other vertices of the graph. FIGURE	Hamiltoni tee = Hamiltoni ahel Tee, mis läbib graafi G iga tippu. Lihtahel, mis ühendab graafi kaht tippu ja läbib selle graafi kõiki ülejäänud tippe. [ÜK82] JOONIS
Hamiltonian path problem Given a graph G = (V, E) , does G contain a Hamiltonian path? [GJ79]	Hamiltoni tee ülesanne Antud on graaf G = (V, E) . Kas G sisaldab Hamiltoni teed?
Hamiltonian-connected graph A graph G is Hamiltonian-connected if for every pair u, v of distinct vertices of G, there exists a Hamiltonian u-v path. [CL96]	sidus Hamiltoni graaf Graaf G on sidus Hamiltoni graaf, kui iga tipupaari u, v puhul leidub Hamiltoni u-v-tee.
Hamming ball A Hamming ball of radius r centered at vertex v consists of all vertices w such that the distance d(v, w) < r , together with some vertices at distance r . [BW97]	Hammingi kera Hammingi kera raadiusega r ja keskpunktiga tipus v koosneb kõigist tippudest w , mille puhul kaugus d(v, w) < r (pluss mõned tipud kaugusel r).
handcuff = bicycle = theta graph A connected graph consisting of two vertex-disjoint polygons and a minimal (not necessarily minimum-length) connecting path (this is a loose handcuff), or of two polygons that meet at a single vertex (a tight handcuff or figure eight). Equivalently, a minimal connected graph with cyclomatic number 2. [TZ98] FIGURE	käerauad = jalgratas = teetagraaf Sidus graaf, mis koosneb kahest ühistippudeta hulknurgast ja minimaalsest (mitte tingimata miinimumpikkusega) ühendusteest (need on lõtvad käerauad). Pingul käerauad koosnevad kahest hulknurgast, millel on üks ühine tipp. Teiste sõnadega, minimaalne sidus graaf tsüklomaatilise arvuga 2. JOONIS
handle Addition to a surface to increase genus. [DW96]	sang Lisand pinna liigi tõstmiseks.
Hanoi graph A graph H_n arising in conjunction with the towers of Hanoi problem. [EW00] FIGURE	Hanoi graaf Hanoi tornide ülesandega seotud graaf H_n . JOONIS
happy end problem The problem of determining the smallest number of points g(n) in general position in the plane (i.e., no three of which are collinear), which always determine a convex polygon of n sides. The problem was so-named by Erdos when two investigators who first worked on the problem, E. Klein and G. Szekeres, became engaged and subsequently married. [EW00]	õnneliku lõpu ülesanne Vähima suvalises asendis (st kolme kollineaarse punktita) punktide arvu g(n) määramise ülesanne tasapinnal. Punktid moodustavad alati n küljega kumera hulknurga. Ülesandele pani nime Erdos, kuna esimesed uurijad, kes ülesandega tegelesid (E. Klein ja G. Szekeres) kihlusid ja seejärel abiellusid.
Harary bipartition A bipartition of the vertex set so that an edge is negative iff its endpoints lie in different parts. [TZ98]	Harary kaksiktükeldus Tippude hulga kaksiktükeldus, nii et serv on negatiivne siis ja ainult siis, kui selle otspunktid asuvad eri osades.
Harary graph The smallest k-connected graph H_k,n with n vertices, having é kn/2 ū edges, where é x ū is the ceiling function. [EW00] k-connected n-vertex graph with minimal number of edges. [DW96] FIGURE	Harary graaf Vähim k-sidus n tipu ja ékn/2 ū servaga graaf H_k,n , kus éx ū on lagifunktsioon. k-sidus n tipuga graaf minimaalse servade arvuga. JOONIS
hard problem A problem is said to be hard if the existence of a fast algorithm for its solution implies that the NP-complete problems are easy. [BC79]	raske ülesanne Ülesanne on raske, kui kiire algoritmi olemasolust selle ülesande lahendamiseks tuleneb, et NP-täielike ülesannete lahendamine on lihtne.
harmonious graph = consistent graph A connected labeled graph with n edges in which all vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of each edge are also distinct (mod n). The ladder graph, fan, wheel graph, Petersen graph, tetrahedral graph, dodecahedral graph, and icosahedral graph are all harmonious. [EW00] Having the vertex-sign product around every polygon equal to +. [TZ98]	harmooniline graaf = kooskõlaline graaf n servaga sidus märgendatud graaf, mille kõik servad saab märgendada eri täisarvudega (mod n), nii et kõigi servade otspunktide arvupaaride summad on samuti erinevad (mod n). Redel, lehvik, ratas, Peterseni graaf, neljatahuline graaf ja kahekümnetahuline graaf on kõik harmoonilised graafid. Tipumärkide korrutis ümber iga hulknurga on + .
H-cordial graph A graph with e edges is called H-cordial if it is possible to label the edges with the numbers from the set N = {+1 , -1} in such a way that at each vertex v the algebraic sum of the labels on the edges incident with v is either +K or -K and the inequalities 1 ³ \| v_f(+K) - v_f(-K) \| and 1 ³ \| e_f(+1) - e_f(-1) \| are also satisfied, where v_f(j) and e_f(j) are, respectively, the number of vertices and edges labeled with j . [IC00]	H-südamlik graaf e servaga graafi nimetatakse H-südamlikuks, kui selle servad saab märgendada arvudega hulgast N = {+1 , -1} nii, et iga tipuga v intsidentsete servade märgendite algebraline summa on kas +K või -K ning on rahuldatud võrratused 1 ³ \| v_f(+K) - v_f(-K) \| ja 1 ³ \| e_f(+1) - e_f(-1) \| , kus v_f(j) ja e_f(j) on vastavalt j-ga märgendatud tippude ja servade arv.
head = negative endpoint The second element of the ordered pair of vertices in a directed graph, head of the arrow. [HN97]	pea = lõpp-punkt Järjestatud tipupaari teine element orienteeritud graafis, noole pea.
heap A tree where every node has a key more extreme (greater or less) than the key of its parent. [PEB00]	kuhik Puu, kus iga tipul on äärmuslikum (suurem või väiksem) võti kui ta ematipul.
Heawood graph The 6-cage. [CL96] The seven-color torus map on 14 nodes. [EW00] FIGURE	Heawoodi graaf 6-puur. Toroidi seitsme värviga kaart 14 tipul. JOONIS
Heawood's formula The chromatic number of a graph embedded on the oriented surface with g handles is at most ė 1/2(7 + (1 + 48g )^1/2)ū . [DW96]	Heawoodi valem Orienteeritud g sangaga pinnal kujutatud graafi kromaatiline arv ei ületa väärtust ė 1/2(7 + (1 + 48g )^1/2)ū .
heigth = heigth of a tree = depth of a tree The maximum distance of any leaf from the root of a tree. If a tree has only one node (the root), the height is one. [PEB00]	kõrgus = puu kõrgus = puu sügavus Suvalise lehe maksimumkaugus puu juurest. Ühe tipuga puu kõrgus on üks.
heigth-balanced binary search tree A data structure which supports membership, insert, and delete operations in time logarithmic in the size of the tree. [PEB00]	tasakaalustatud kõrgusega kahendotsingupuu Andmestruktuur, mis võimaldab kuuluvus-, lisamis- ja kustutusoperatsioone logaritmilises ajas olenevalt puu kõrgusest.
heigth of a tree = depth of a tree = heigth	puu kõrgus = kõrgus = puu sügavus
Helly circular-arc graph An undirected graph for which there exists a circular-arc representation that satisfies the Helly property. [MG80]	Helly tsirkulaargraaf Orienteerimata graaf, mille jaoks leidub Helly omadust rahuldav tsirkulaaresitus.
Helly number For some universe, the number k such that the sets in F have a common intersection. [DW96]	Helly arv Teatud üldkogumi jaoks arv k , mille puhul F-i kuuluvatel hulkadel on ühine ühisosa.
Helly property A family {T_i}_{iĪ I}of subsets of a set T is said to satisfy the Helly property if JĶI and T_iĒT_j¹ 0 for all i, j ĪJ implies that Ē _{j Ī J}T_j¹ 0 . [MG80] The property of the real line (or trees) that any collection of pairwise intersecting subsets has a common intersection point. [DW96]	Helly omadus Hulga T alamhulkade pere {T_i}_iĪ I rahuldab Helly omadust, kui J ĶI ja T_i Ē T_j¹ 0 ( " i, j ĪJ ) puhul Ē _{j Ī J}T_j¹ 0 . Lõigu (või puude) omadus, kus paariti lõikuvate alamhulkade suvalisel kogumil on ühine lõikepunkt.
heptadaidecagon A polygon with seventeen sides. [HC00]	seitseteistnurk Seitsmeteistkümne küljega hulknurk.
heptagon A polygon with seven sides. [HC00]	seitsenurk Seitsme küljega hulknurk.
heptahedral graph A polyhedral graph on seven nodes. [EW00] FIGURE	seitsmetahuline graaf Hulktahuline graaf seitsmel tipul. JOONIS
hereditary class A class F for which every induced subgraph of a graph in F is also in F. [DW96]	pärilik klass Klass F , mille puhul iga F-i kuuluva graafi tekitatud alamgraaf kuulub samuti F-i .
hereditary family A family F of sets such that every subset of a member of F is in F . [DW96]	pärilik pere Hulkade pere F , kus F-i liikme iga alamhulk kuulub samuti peresse F .
hereditary system A system consisting of a hereditary family and the alternative ways of specifying the family. [DW96]	pärilik süsteem Süsteem, kuhu kuulub pärilik pere ja erinevad viisid pere kirjeldamiseks.
hermit point = isolated point = acnode	isoleeritud punkt
heuristics In mathematical programming, this usually means a procedure that seeks a solution but does not guarantee it will find one. It is often used in contrast to an algorithm, so branch and bound would not be considered a heuristic in this sense. In AI, however, a heuristic is an algorithm (with some guarantees) that uses a heuristic function to estimate the "cost" of branching from a given node to a leaf of the search tree. [HG99] Based on or involving trial and error. Convincing without being rigorous. [EW00]	heuristika Matemaatilises plaanimises tavaliselt protseduur, mis otsib lahendit, kuid ei taga selle leidmist. Kasutatakse sageli algoritmi vastandina (nt harude ja tõkete meetod pole selles mõttes heuristika). Intellektitehnikas nimetatakse heuristikaks teatud tagatistega algoritmi, mis kasutab antud tipust otsingupuu lehte hargnemise "hinna" määramiseks heuristilist funktsiooni. Proovi ja eksituse meetodit sisaldav. Toimiv, kuid mitte range.
heuristic function This is used to guide the search, as a human would do. In this sense, it is a rule of thumb. Formally, in AI, a heuristic function is defined on the state of a search tree and is used in the evaluation of nodes for expansion in what is sometimes called a best-first directed tree search strategy. [HG99]	heuristiline funktsioon Kasutatakse otsingu suunamiseks analoogiliselt inimese käitumisele. Teiste sõnadega, rusikareegel. Formaalselt defineeritakse heuristiline funktsioon intellektitehnikas otsingupuu olekul ning seda kasutatakse tippude hindamiseks otsingu laiendamisel. Kutsutakse ka otsingustrateegiaks "parim-enne".
heuristic search In mathematical programming, this is any (purposeful) search procedure to seek a solution to a global optimization problem, notably to combinatorial optimization. In AI, this is a (partially) informed search (vs. blind search), using a heuristic function for guidance. Two types of (blind) search methods are breadth-first search and depth-first search. A specific class of local heuristic search algorithms is the greedy algorithm. Another type is the n-Opt for the TSP. Here are heuristic search strategies that are based on some biological metaphor: Ant colony optimization, based on how ants solve problems; Genetic algorithm, based on genetics and evolution; Neural networks, based on how the brain functions; Simulated annealing, based on thermodynamics; Tabu search, based on memory-response; Target analysis, based on learning. [HG99]	heuristiline otsing Matemaatilises plaanimises suvaline (sihipärane) otsinguprotseduur globaalse optimeerimisülesande lahendi otsimiseks või kombinatoorseks optimeerimsieks. Intellektitehnikas on see osalise teabega otsing (vastandina pimeotsingule), kusjuures teabe hankimiseks kasutatakse heuristilist funktsiooni. Pimeotsingu tüübid on laiutiotsing ja sügavutiotsing. Ahne algoritm kuulub lokaalsete heuristiliste algoritmide kindlasse klassi. Teine analoogiline tüüp on n-Opt proovireisija ülesande jaoks. Järgmised heuristilised otsingustrateegiad põhinevad teatud bioloogilisele metafoorile: Sipelgoptimeerimine (baseerub sipelgate tegevusel); Geneetiline algoritm (baseerub geneetikal ja arengul); Närvivõrgud (baseerub aju talitlusel); Simuleeritud lõõmutus (baseerub termodünaamikal); Tabuotsing (baseerub mälureaktsioonil); Sihtanalüüs (baseerub õppimisel).
hexagon A polygon figure with six sides. [HC00]	kuusnurk Kuue küljega hulknurk.
hexahedral graph A polyhedral graph on six vertices. [EW00] FIGURE	kuuetahuline graaf Kuue tipuga hulktahuline graaf. JOONIS
H-free Having no copy of H as an induced subgraph. [DW96]	H-vaba Ei sisalda graafi H koopiat tekitatud alamgraafina.
hinge = cut vertex	liigend = lõiketipp
hinging = cut vertex	liigend = lõiketipp
hitting set = edge cover	servakate
Hoffman-Singleton graph The 7-regular Moore graph of girth 5 (and of order 50). [CL96] The only graph of diameter 2, girth 5, and valency 7 . [EW00] FIGURE	Hoffman-Singletoni graaf 7-regulaarne Moore'i graaf ümbermõõduga 5 (ja järguga 50) . Ainus graaf läbimõõduga 2, ümbermõõduga 5 ja järguga 7 . JOONIS
hole A chordless cycle in a graph. [DW96] FIGURE	auk Graafi kõõludeta tsükkel. JOONIS
homeomorph A graph obtained from another by inserting new nodes along existing edges. [ODC00] FIGURE	homöomorf Graaf, mis tekib uute tippude lisamisel piki olemasolevaid servi. JOONIS
homeomorphic graphs = homomorphic graphs	homöomorfsed graafid
homomorphic graphs Two graphs are homeomorphic if they can both be obtained from a common graph by a sequence of replacing edges by simple chains. In appearance, homeomorphic graphs look like ones that have extra vertices added to or removed from edges. [WC00] Two graphs are homomorphic if they can be made isomorphic by inserting new vertices of degree 2 into edges. [PEB00]	homöomorfsed graafid Kaks graafi on homöomorfsed, kui neid on võimalik tekitada ühest ja samast graafist servade asendamise teel lihtteedega. Homöomorfsed graafid näevad välja, nagu oleks nende servadele lisatud (või sealt eemaldatud) täiendavaid tippe. Kaks graafi on homöomorfsed, kui nad saab muuta isomorfseks uute kaheastmeliste tippude lisamise teel.
homeomorphism = homomorphism A homeomorphism is an injective (one-to-one), continuous transformation of one topological space onto another whose inverse is also continuous.[PR98] A map f: V(G) ® V(H) that preserves adjacency. [DW96]	homöomorfism Topoloogilise ruumi injektiivne (üksühene) pidev teisendus teiseks topoloogiliseks ruumiks, mille pöördteisendus on samuti pidev. Teisendus f: V(G) ®V(H) , mis säilitab intsidentsusseosed.
homomorphism = homeomorphism	homöomorfism
Hopfield network John Hopfield in the early 1980's investigated a particular kind of neural network which is now commonly referred to as the Hopfield network or Hopfield model. In the Hopfield network, there are no special input or output neurons (see McCulloch-Pitts), but all are both input and output, and all are connected to all others in both directions (with equal weights in the two directions). Input is applied simultaneously to all neurons which then output to each other and the process continues until a stable state is reached, which represents the network output. [CERN97]	Hopfieldi võrk John Hopfield uuris 80-date aastate alguses teatud tüüpi närvivõrku, mida praegu nimetatakse tavaliselt Hopfieldi võrguks või Hopfieldi mudeliks. Hopfieldi võrgus ei ole spetsiaalseid sisend- ega väljundneuroneid (vt McCulloch-Pittsi neuron), vaid kõik neuronid on varustatud nii sisendi kui ka väljundiga ning mõlemas suunas (võrdsete kaaludega) teistega ühendatud. Sisendsignaal rakendatakse korraga kõigile neuronitele, väljundid edastatakse üksteisele ning protsess jätkub stabiilse oleku saavutamiseni, mis esindabki võrgu üldist väljundit.
H-subdivision A graph obtained from H by subdivisions. [DW96]	H-alajaotusgraaf Graafist H alajaotusoperatsioonide rakendamisel saadud graaf.
hub The central point in a wheel graph W_n. The hub has degree n – 1 .[EW00] FIGURE	rumm Ratasgraafi W_n kesktipp. Rummu aste on n – 1 . JOONIS
Hungarian method An alghorithm for solving the assignment problem. [DW96]	ungari meetod Algoritm määramisülesande lahendamiseks.
Husimi tree A graph in which every block is a clique. [DW96]	Husimi puu Graaf, mille iga plokk on klikk.
hybrid analysis The analysis of electrical networks where unknowns involve both voltages and currents. [HN97]	hübriidanalüüs Elektrivõrkude analüüs, kus tundmatute hulka kuuluvad nii pingete kui ka voolude väärtused.
hybrid bond graph Bond graph which contains junctions that act as ideal switches and that are controlled by local finite state machines. [PM99]	hübriidne sidemegraaf Sidemegraaf, mis sisaldab ideaalse lülitina toimivaid tippe, mida juhivad lokaalsed lõplikud olekumasinad.
hybrid flow net Consists of a continuous flow net interacting with a Petri net according to a control interaction, i.e., the Petri net controls the continuous flow net and vice versa. [PM99]	hübriidne voovõrk Koosneb pidevast voovõrgust ja Petri võrgust, mis teineteisega suhtlevad, st Petri võrk juhib pidevat voovõrku ja vastupidi.
hybrid Petri net Consists of a "continuous part" (continuous places and transitions) and a "discrete part" (discrete places and transitions). [PM99]	hübriidne Petri võrk Koosneb "pidevast osast" (pidevad asukohad ja siirded) ning "diskreetsest osast" (diskreetsed asukohad ja siirded).
hybrid rank = topological degree of freedom	hübriidastak = topoloogiline vabadusaste
hypercube A Cartesian product of copies of K₂ . [DW96] FIGURE	hüperkuup Graafi K₂ koopiate otsekorrutis. JOONIS
hyperedge A connection between two or more vertices of a hypergraph. A hyperedge connecting just two vertices is simply a usual edge. [EW00]	hüperserv Seos hüpergraafi kahe või mitme tipu vahel. Kahte tippu ühendav hüperserv on lihtsalt tavaline serv.
hypergraph Hypergraph H is a pair (V(H), E(H)) where V(H) is the set of vertices of H and E(H) is a family of subsets of V(H)called the hyperedges of H . [HN97] A set of nodes (or vertices), say V, plus a set of edges, say E, such that each member of E is a subset of V. When each member of E has exactly 2 nodes, [V, E] is a graph. The hypergraph is a convenient mathematical way to describe relations that involve more than two objects (nodes). [HG99]	hüpergraaf Hüpergraaf H on paar (V(H), E(H)) , kus V(H) on hüpergraafi H tippude hulk ja E(H) on hulga V(H)alamhulkade (H hüperservade) pere. Tippude hulk V ja servade hulk E , kusjuures hulga E iga element on hulga V alamhulk. Kui E iga liige sisaldab täpselt 2 tippu, siis on [V, E] graaf. Hüpergraaf on mugav matemaatiline viis enam kui kahte objekti (tippu) sisaldavate seoste kirjeldamiseks.
hyperplane In a matroid, a maximal closed proper subset of the ground set. [DW96]	hüpertasand Matroidi baashulga maksimaalne suletud pärisalamhulk.
hypobase In a matroid, a maximal set containing no base. [DW96]	hüpobaas Maksimaalne hulk matroidis, mis ei sisalda baasi.
hypohamiltonian A non-Hamiltonian graph whose vertex-deleted subgraphs are all Hamiltonian. [DW96] FIGURE	Hamiltoni hüpograaf Mitte-Hamiltoni graaf, mille tippude kustutamisel tekkivad alamgraafid on kõik Hamiltoni graafid. JOONIS
hypothesis = conjecture A proposition that is consistent with known data, but has been neither verified nor shown to be false. [EW00]	hüpotees Lause, mis ei ole vastuolus teadaolevate andmetega, kuid mida pole tõestatud ega ümber lükatud.
hypotraceable graph A non-traceable graph whose vertex-deleted subgraphs are all traceable. [DW96]	hüposeostatav graaf Mitteseostatav graaf, mille tippude kustutamisel tekkivad alamgraafid on kõik seostatavad.

| # | a | b | c-cn | co | cp-cz | d | e | f | g | h | i | j | k | l | m-mh | mi | mj-mz |

| n | o | p | q | r | s-so | sp-sz | t | u | v | w | xyz |

2002 Mati Littover ml@ioc.ee