Некатегоризованные страницы

Материал из WikiGrapp

Ниже показано до 500 результатов в диапазоне от 61 до 560.

Просмотреть ( | ) (20 | 50 | 100 | 250 | 500)

  1. A-reprezentation of a cf-graph
  2. A-граф
  3. A-представление уграфа
  4. ANC-Грамматика
  5. AT-Free graph
  6. AVL-Tree
  7. Abdiff-tolerance competition graph
  8. Absolute hypergraph
  9. Absolute incenter
  10. Absolute inner radius
  11. Absolute median
  12. Absolute of a rooted tree
  13. Absolute outcenter
  14. Absolute outer radius
  15. Absolute retract
  16. Absorbant set
  17. Absorbent set
  18. Abstract computer
  19. Abstract graph
  20. Abstract machine
  21. Abstract syntax tree
  22. Acceptable assignment
  23. Access term
  24. Achromatic number
  25. Achromatic status
  26. Ackermann's function
  27. Acyclic chromatic number
  28. Acyclic colouring
  29. Acyclic dominating set
  30. Acyclic domination number
  31. Acyclic orientation
  32. Additive hereditary graph property
  33. Addressable transformation graph
  34. Addressing scheme
  35. Adjacency
  36. Adjacency list
  37. Adjacency matrix
  38. Adjacency operator
  39. Adjacency property
  40. Adjacent arcs
  41. Adjacent edges
  42. Adjacent faces
  43. Adjacent forest graph
  44. Adjacent graphs
  45. Adjacent vertices
  46. Adjoint digraph
  47. Admissible sequence
  48. Advancing arc
  49. Algebraic connectivity
  50. Algebraic graph theory
  51. Algorithm
  52. Alive Petri net
  53. Almost 3-regular
  54. Almost cubic graph
  55. Alpha-Acyclic hypergraph
  56. Alpha-Approximable problem
  57. Alpha-Cyclic hypergraph
  58. Alphabet
  59. Alt
  60. Alternating chain
  61. Amalgam
  62. Amalgamation of a graph
  63. Amallamorphic graphs
  64. Amount of a flow
  65. Anarboricity of a graph
  66. Ancestor of a vertex
  67. Animal
  68. Annihilator
  69. Anti-gem
  70. Antichain
  71. Anticlique
  72. Antidependence
  73. Antidirected Hamiltonian cycle
  74. Antidirected Hamiltonian path
  75. Antidirected path
  76. Antihole
  77. Antimagic graph
  78. Antiparallel arcs
  79. Antiprism
  80. Antisymmetric graph
  81. Antisymmetric relation
  82. Apex graph
  83. Approximate point spectrum
  84. Approximation algorithm
  85. Arbitrarily hamiltonian graph
  86. Arbitrarily traceable graph
  87. Arbitrarily traverseable graph
  88. Arbitrarily vertex decomposable graph
  89. Arboreal hypergraph
  90. Arborescence
  91. Arboricity of a graph
  92. Arc-forwarding index
  93. Arc base
  94. Argument
  95. Arithmetic graph
  96. Arrangeable alt
  97. Arrangement
  98. Articulation point
  99. Articulation set
  100. Assignment problem
  101. Associated Cayley digraph
  102. Associated undirected graph
  103. Associative search
  104. Asteroidal number
  105. Asteroidal set
  106. Asteroidal triple
  107. Asymmetric graph
  108. Asymmetric relation
  109. Atomic formula
  110. Attachment graph
  111. Attribute grammar
  112. Attribute tree
  113. Augmented adjacency matrix
  114. Augmenting chain
  115. Automata theory
  116. Automorphism
  117. Automorphism group
  118. Automorphism problem
  119. Average connectivity
  120. Average domination number
  121. Average independent domination number
  122. B-Tree
  123. B-Дерево
  124. BB-Tree
  125. BB-Дерево
  126. Back-edge
  127. Backbone
  128. Backbone coloring
  129. Backbone coloring number
  130. Backward arc
  131. Balance of a vertex
  132. Balanced circuit
  133. Balanced digraph
  134. Balanced graph
  135. Balanced hypergraph
  136. Balanced signed graph
  137. Ball number
  138. Bandwidth
  139. Bandwidth sum
  140. Bar-visibility graph
  141. Base digraph
  142. Base of a directed graph
  143. Base of a matroid
  144. Based graph
  145. Basic block
  146. Basic cycle
  147. Basic cycle set
  148. Basic numberings
  149. Basis number
  150. Basis of a digraph
  151. Bayesian network
  152. Beraha number
  153. Berge's Formula
  154. Berge's complete graph
  155. Berge's conjecture
  156. Berge graph
  157. Bi-Helly family
  158. Biblock
  159. Bicenter
  160. Bicenter tree
  161. Bicentre
  162. Bicentroid of a tree
  163. Bichordal bipartite graph
  164. Bichromatic graph
  165. Bichromatic hypergraph
  166. Biclique
  167. Biclique edge cover
  168. Biclique edge covering number
  169. Biclique number
  170. Bicoloured subgraph
  171. Bicomponent
  172. Biconnected component
  173. Biconvex bipartite graph
  174. Bicritical graph
  175. Bicubic graph
  176. Bidirectional arcs
  177. Bifurcant
  178. Bigraph
  179. Bihypergraph
  180. Binary Hamming graph
  181. Binary de Bruijn graph
  182. Binary matroid
  183. Binary n-dimensional cube
  184. Binary relation
  185. Binary search tree
  186. Binary sorting tree
  187. Binary split tree
  188. Binary tree
  189. Binary vertex
  190. Binode
  191. Binomial tree
  192. Bipanpositionable graph
  193. Bipartite bihypergraph
  194. Bipartite density
  195. Bipartite graph
  196. Bipartite matroid
  197. Bipartite permutation graph
  198. Bipartite tolerance graph
  199. Bipyramid
  200. Bisection width of a graph
  201. Bisimplicial edge
  202. Bistochastic matrix
  203. Block
  204. Block-cutvertex tree, block-cutpoint graph
  205. Block duplicate graph
  206. Block of a graph
  207. Bondy-Chvatal closure operation
  208. Boundary NCE graph grammar
  209. Boundary node of a fragment
  210. Boundary of a 2-mesh
  211. Boundary of a face
  212. Boundary operator
  213. Bounded Petri net
  214. Bounded reachability matrix
  215. Bounded reaching matrix
  216. Bounded tolerance graph
  217. Boundedness problem
  218. Branch-weight centroid number
  219. Branch of a tree relative to a vertex v
  220. Breadth first search
  221. Bridge
  222. Bridged graph
  223. Bridgeless graph
  224. Broadcast digraph
  225. Broadcast graph
  226. Broadcasting problem
  227. Brooks graph
  228. Brother of a vertex
  229. Brother tree
  230. Brute force'' method
  231. Bull
  232. Butterfly graph
  233. C-Chordal graph
  234. CF-Language
  235. CF-grammar
  236. CKI-орграф
  237. CPM
  238. CS-Grammar
  239. CS-language
  240. Cactus
  241. Cage number
  242. Call graph
  243. Capacity of a cut-set
  244. Capacity of an arc
  245. Cardinal product
  246. Cardinality constrained circuit problem
  247. Cartesian product of graphs
  248. Cartesian sum of graphs
  249. Case term
  250. Categorical product of graphs
  251. Caterpillar
  252. Caterpillar-pure graph
  253. Cayley graph
  254. Center
  255. Center of gravity of a graph
  256. Center vertex
  257. Central distance
  258. Central fringe
  259. Central vertex
  260. Centroid
  261. Centroid sequence
  262. Centroid vertex
  263. Centroidal vertex
  264. Cf-Graph
  265. Chain
  266. Chain graph
  267. Characteristic number of a graph
  268. Characteristic polynomial of Laplacian
  269. Characteristic polynomial of a graph
  270. Chinese postman's problem
  271. Choice number
  272. Chomsky hierarchy
  273. Chomsky normal form
  274. Choosability
  275. Chord
  276. Chordal bipartite graph
  277. Chordal graph
  278. Chordless cycle
  279. Chromatic decomposition of a graph
  280. Chromatic distance
  281. Chromatic function
  282. Chromatic index
  283. Chromatic number
  284. Chromatic polynomial
  285. Chromatic status
  286. Chromatically equivalent graphs
  287. Chromatically unique graph
  288. Church's thesis
  289. Circuit
  290. Circuit closed graph
  291. Circuit edge connected vertices
  292. Circuit isomorphic graphs
  293. Circuit of matroid
  294. Circuit rank
  295. Circuitless graph
  296. Circulant graph
  297. Circular-arc graph
  298. Circular chromatic number
  299. Circular clique number
  300. Circular coloring of a graph
  301. Circular perfect graph
  302. Circumference of a graph
  303. Circumstance
  304. Circumstance problem
  305. Classification of Binary Trees
  306. Claw
  307. Claw-free graph
  308. Clique
  309. Clique-good graph
  310. Clique-independence number
  311. Clique-independent set
  312. Clique-partition
  313. Clique-perfect graph
  314. Clique-transversal
  315. Clique-transversal number
  316. Clique-width
  317. Clique convergent
  318. Clique cover
  319. Clique cover number, clique-covering number
  320. Clique divergent
  321. Clique graph
  322. Clique matrix
  323. Clique model
  324. Clique number
  325. Clique polynomial
  326. Clique problem
  327. Clique separator
  328. Clique size
  329. Clique tree
  330. Closed hamiltonian neighbourhood
  331. Closed neighbourhood
  332. Closed semiring
  333. Closed walk
  334. Closure of graph
  335. Cluster
  336. Clustered graph
  337. Clutter
  338. Coadjoint graphs
  339. Coadjoint pair
  340. Coalescing of two rooted graphs
  341. Coarseness
  342. Cobase of a matroid
  343. Coboundary of a graph
  344. Coboundary operator
  345. Cochromatic number
  346. Cocircuit of a graph
  347. Cocircuit of a matroid
  348. Cocomparability graph
  349. Cocomparability number
  350. Cocomparability ordering
  351. Cocycle
  352. Cocycle basis
  353. Cocycle vector
  354. Cocyclic matrix
  355. Cocyclic rank of a graph
  356. Code of a tree
  357. Codependent set of a matroid
  358. Codiameter
  359. Codistance
  360. Cograph
  361. Cographic matroid
  362. Coindependent set of a matroid
  363. Color graph of a group
  364. Color requirement of a vertex
  365. Coloration
  366. Colored distance
  367. Colored graph
  368. Colored multigraph
  369. Coloring, colouring
  370. Coloring number
  371. Coloured Petri net
  372. Coloured class
  373. Combinatorial Laplacian
  374. Combinatorial dual graph, combinatorically dual graph
  375. Comet
  376. Common ancestor
  377. Common minimal dominating graph
  378. Common receiver
  379. Common server
  380. Compact
  381. Compact closed class of graphs
  382. Comparability graph
  383. Comparable vertices
  384. Competition-common enemy graph
  385. Competition graph (of a tournament)
  386. Competition number
  387. Compilation problem
  388. Complement-reducible graph
  389. Complement of a graph, complementary graph
  390. Complete bipartite graph
  391. Complete coloring
  392. Complete colouring
  393. Complete directed graph
  394. Complete graph
  395. Complete homomorphism of order n
  396. Complete k-partite graph
  397. Complete k-uniform hypergraph
  398. Complete multipartite graph
  399. Complete product
  400. Complete rotation
  401. Complete set of graph invariants
  402. Complete system of equivalent transformations
  403. Complete tree
  404. Completed Husimi tree
  405. Completely triangular graph
  406. Complex windmill
  407. Complexity of RAM
  408. Complexity theory
  409. Component design method
  410. Component index
  411. Component number
  412. Component of a graph
  413. Composite hammock
  414. Composition of graphs
  415. Compound dependency graph
  416. Compound graph
  417. Computation
  418. Concatenation
  419. Concatenation closure
  420. Concepts Path Graph
  421. Conceptual graph
  422. Condensation
  423. Conditional connectivity
  424. Cone over a graph
  425. Conflict
  426. Confluent NCE graph grammar
  427. Conformal hypergraph
  428. Conjunction of graphs
  429. Connected component
  430. Connected component of a hypergraph
  431. Connected dominating set
  432. Connected domination number
  433. Connected graph
  434. Connected hierarchical graph
  435. Connected hypergraph
  436. Connected set of vertices
  437. Connected to relation
  438. Connected vertices
  439. Connective index
  440. Connectivity
  441. Connectivity axioms
  442. Connectivity function
  443. Connectivity matrix
  444. Consecutive adjacent graph
  445. Consecutive labeling
  446. Constructible graph
  447. Constructing enumeration
  448. Constructing order
  449. Containment graph
  450. Context-free grammar
  451. Context-free language
  452. Context-sensitive grammar
  453. Context-sensitive language
  454. Contrabasis
  455. Contractable edge
  456. Contracted visibility graph
  457. Contracting edge, contraction of an edge
  458. Contraction of a graph
  459. Contraction of an even pair
  460. Contrafunctional graph
  461. Control dependence
  462. Converse digraph
  463. Convex bipartite graph
  464. Convex dominating set
  465. Convex domination number
  466. Convex linear graph
  467. Convex set in G
  468. Coordinated graph
  469. Corank function of a matroid
  470. Core
  471. Corona
  472. Cospectral graphs
  473. Cotree, co-tree
  474. Countable graph
  475. Counter automation
  476. Coverability tree
  477. Covering cycle
  478. Covering graph
  479. Covering set of vertices
  480. Covering vertex set
  481. Critical edge
  482. Critical graph
  483. Critical kernel-imperfect digraph
  484. Critical pair
  485. Critical path
  486. Critical path method
  487. Critical set
  488. Critical tournament
  489. Critical vertex
  490. Criticality index
  491. Critically k-connected graph
  492. Cross
  493. Cross-adjacent edges
  494. Cross-chromatic index
  495. Cross-free coloring
  496. Cross-free matching
  497. Cross-free matching number
  498. Cross arc
  499. Cross product
  500. Crossing number

Просмотреть ( | ) (20 | 50 | 100 | 250 | 500)

Источник — http://pco.iis.nsk.su/grapp/index.php/Служебная:Некатегоризованные_страницы