Страницы-сироты

Перейти к навигации Перейти к поиску

На следующие страницы нет ссылок с других страниц WikiGrapp, и они не включаются в другие страницы.

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

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

  1. Problem size
  2. Process
  3. Process net
  4. Process net with competition
  5. Product of two languages
  6. Production
  7. Production grammar
  8. Profile numbering
  9. Profile of a graph
  10. Profile of numbering
  11. Profile width of a vertex
  12. Program of automaton
  13. Proper dominator
  14. Proper labeling
  15. Proper substring
  16. Provable problem
  17. Pseudo-h-hamiltonian cycle
  18. Pseudo-h-hamiltonian graph
  19. Pseudo-hamiltonian graph
  20. Pseudo-hamiltonicity number
  21. Pseudo-polynomial algorithm
  22. Pseudo-product
  23. Pseudo-wheel
  24. Pseudograceful graph
  25. Pseudosimilar vertices
  26. Pumping lemmas
  27. Pushdown automaton
  28. Q-Периферийная вершина
  29. Quadrilateral
  30. Quadtree
  31. Quasi-bipartite mixed graph
  32. Quasi-diameter
  33. Quasi-radius
  34. Quasi-transitive tournament
  35. R-Circular colorable graph
  36. R-Identifying code
  37. Radial path
  38. Radius-essential edge
  39. Ramanujan graph
  40. Ramsey graph game
  41. Rank of a hypergraph
  42. Ranking number
  43. Reach-preservable graph
  44. Reach-preserving vertex
  45. Reachability graph
  46. Reachability problem
  47. Reachable (from a) vertex
  48. Realizer of P
  49. Receiver
  50. Recognizer
  51. Recursive set
  52. Recursively enumerable set
  53. Redex
  54. Reducible additive hereditary graph property
  55. Reducible by Hecht and Ullman flow graph
  56. Reflexive graph
  57. Reflexive relation
  58. Register-interference graph
  59. Regular Petri net
  60. Regular Petri net with finite marking
  61. Regular basic subnet
  62. Regular expression
  63. Regular loop
  64. Regular matroid
  65. Regular set
  66. Regular tournament
  67. Relation
  68. Relation precedence
  69. Removal-similar vertices
  70. Removal of a set of vertices
  71. Repetion-free scheme
  72. Restrained dominating set
  73. Restricted block duplicate graph
  74. Restricted domination number
  75. Restricted unimodular chordal graph
  76. Restriction of a hypergraph
  77. Result
  78. Retraction
  79. Retreating arc
  80. Reverse arc
  81. Reverse digraph
  82. Reverse path
  83. Ridge graph
  84. Right-linear language
  85. Right-linear tree
  86. Right-sided balanced tree
  87. Rigid graph
  88. Rim
  89. Ring-sum
  90. Roman domination
  91. Rooted product
  92. Round forest
  93. Route
  94. S-Gonal tree
  95. SSSP problem
  96. Safe Petri net
  97. Safe place
  98. Safeness problem
  99. Saturated vertex
  100. Schema simulation
  101. Schema with node number repetition
  102. Scorpion
  103. Second Order formula
  104. Section
  105. Segment
  106. Seidel characteristic polynomial
  107. Seidel spectrum
  108. Seidel switching
  109. Self-centered graph
  110. Self-converse digraph
  111. Self-loop
  112. Self-modified Petri net
  113. Selfdual tournament
  114. Semaphore
  115. Semi-Strong Perfect Graph Conjecture
  116. Semicomplete c-partite digraph
  117. Semicomplete digraph
  118. Semicomplete multipartite digraph
  119. Semidecidable problem
  120. Semigirth
  121. Semigroup of a graph
  122. Semikernel
  123. Semikernel modulo F
  124. Semisymmetric graph
  125. Sentence
  126. Sentencial form
  127. Separation-width
  128. Sequential-alternative process
  129. Sequential-alternative process net
  130. Sequential-parallel control structure
  131. Sequential control structure
  132. Sequential process
  133. Series-parallel graph
  134. Server
  135. Set
  136. Set of firing sequences
  137. Set of priorities
  138. Set of reachable markings
  139. Shell
  140. Shortest-path distance
  141. Shredder
  142. Sierpinski graph
  143. Signed dominating function
  144. Signed domination number
  145. Signed total domination
  146. Signed total domination function
  147. Signed total domination number
  148. Simple clique polynomial
  149. Simple eigenvalue
  150. Simple elimination ordering
  151. Simple hierarchical graph
  152. Simple hypergraph
  153. Simple loop
  154. Simple transition
  155. Simple vertex
  156. Simplicial clique
  157. Simply sequential numbering
  158. Sink-tree
  159. Size of a directed hypergraph
  160. Skeleton graph
  161. Skewed tree
  162. Skirting cycle
  163. Skolem-graceful graph
  164. Skolem-labeling
  165. Smith graph
  166. Snark
  167. Solution of a digraph
  168. Solvable problem
  169. Son of a vertex
  170. Span-labeling
  171. Span of f
  172. Spanning cotree
  173. Spanning hypertree
  174. Sperner's Lemma
  175. Spider
  176. Split dominating set
  177. Split domination number
  178. Split isomorphism
  179. Splitoid
  180. Splitting of a vertice
  181. Splitting off
  182. Squared graph
  183. Stability function
  184. Stamen of a flower
  185. Standard form of a net
  186. Star
  187. Star coloring
  188. Starlike tree
  189. Start operator
  190. Starting node of a fragment
  191. State
  192. State-machine Petri net
  193. State of compound transition
  194. Steiner distance
  195. Steiner minimal tree
  196. Steiner n-center
  197. Steiner n-eccentricity
  198. Steiner trade
  199. Stem
  200. Stochastic Petri nets
  201. Stop operator
  202. Stratified net formula
  203. Stretcher
  204. Strong Helly property
  205. Strong argument
  206. Strong chromatic index
  207. Strong closure of a graph
  208. Strong component of a digraph
  209. Strong dominating set
  210. Strong domination number
  211. Strong input
  212. Strong matching
  213. Strong orientation
  214. Strong output
  215. Strong product of graphs
  216. Strong result
  217. Strong support vertex
  218. Strong unique independence graph
  219. Strongly NP-complete problem
  220. Strongly NP-hard problem
  221. Strongly coadjoint vertices
  222. Strongly connected vertices
  223. Strongly dense m-ary tree
  224. Strongly equistable graph
  225. Strongly geodetic graph
  226. Strongly perfect graph
  227. Structured net formula
  228. Subgraph derivable graph
  229. Subgraph derivation
  230. Subnet
  231. Suborthogonal double cover
  232. Suborthogonal subgraph
  233. Substitution of a graph
  234. Substitutional closure
  235. Substring
  236. Subword
  237. Succession relation
  238. Successive coloring
  239. Suffix
  240. Sum graph
  241. Sum hypergraph
  242. Sum labeling
  243. Sum number
  244. Sum of graphs
  245. Sunlike graph
  246. Super (a,d)-edge-antimagic total graph
  247. Super point-connected graph
  248. Superconnected graph
  249. Supercritical graph
  250. Supereulerian graph
  251. Supereulerian index
  252. Supermagic graph
  253. Superoblique graph
  254. Superperfect graph
  255. Support vertex
  256. Surviving route digraph
  257. Switch equivalent graphs
  258. Switch operation
  259. Switching
  260. Symbol
  261. Synchrograph
  262. Synchronization graph
  263. Syntactical diagram
  264. System of disjoint representatives
  265. System of distinct representatives
  266. T-Code (in a graph)
  267. T-Color-critical
  268. T-Join
  269. T-Spanner
  270. T-Tough graph
  271. TREEWIDTH problem
  272. Tail of a hyperarc
  273. Tail place
  274. Target
  275. Tensor product
  276. Terminal alphabet
  277. Terminal marking
  278. Terminal node of a fragment
  279. Terminal state
  280. Terminal symbol
  281. Termination of a compound transition
  282. Test and decrement operator
  283. Tightly connected vertices
  284. Timed Petri nets
  285. Token
  286. Tolerance representation
  287. Total Z-transformation graph
  288. Total dominating function
  289. Total dominating number
  290. Total dominating set
  291. Total domination edge critical graph
  292. Total domination number
  293. Total domination subdivision number
  294. Total edge length of a graph
  295. Total k-subdominating function
  296. Total k-subdomination number
  297. Total labeling
  298. Total restrained dominating set
  299. Totally balanced matrix
  300. Totally irregular graph
  301. Totally stratified net formula
  302. Toughness of a graph
  303. Traceable digraph
  304. Traceable graph
  305. Trampoline of order p
  306. Transformer
  307. Transition
  308. Transition firing
  309. Transitive series-parallel digraph
  310. Transposition symmetry permutation
  311. Transversal number
  312. Transversal set
  313. Trap
  314. Trapezoid graph
  315. Traveling tourist problem
  316. Tree-decomposition
  317. Tree-perfect graph
  318. Tree automaton
  319. Tree domination number
  320. Tree t-spanner
  321. Triad
  322. Triangular graph
  323. Triangulated-perfect graph
  324. Triangulated triangle
  325. Triangulation of a circuit
  326. Triangulation of a graph
  327. Triconnected graph
  328. Trie
  329. Trivial deadend
  330. Trivial deadlok
  331. Trivial interval
  332. Trivial tree
  333. True dependence
  334. Tutte polynomial
  335. Two-terminal DAG
  336. Two-way infinite path
  337. Two-way pushdown automaton
  338. Type-0 grammar
  339. Type-1 grammar
  340. Type-2 grammar
  341. Type-3 grammar
  342. UPC-graphs
  343. Ultracenter
  344. Ultraradius
  345. Unbalanced tree
  346. Unbounded Petri net
  347. Unbounded place
  348. Underlying hyperedge tree
  349. Underlying vertex tree
  350. Undirected hyperpath
  351. Unfold process net
  352. Unicursal graph
  353. Uniform central graph
  354. Uniform hypergraph
  355. Uniform inflation
  356. Uniform star-factor
  357. Unilateral connectivity
  358. Unique eccentric point graph
  359. Uniquely pancyclic graph
  360. Universal graph
  361. Unordered labeled tree
  362. Unsaturated vertex
  363. Upper-level transition
  364. Upper n-domination number
  365. Value of a schema under interpretation
  366. Vertex-antimagic total labeling
  367. Vertex-clique incidence bigraph
  368. Vertex-cover polynomial
  369. Vertex-edge incidence matching
  370. Vertex-edge incidence matrix
  371. Vertex-forwarding index
  372. Vertex-labeling
  373. Vertex-magic graph
  374. Vertex-magic labeling
  375. Vertex-magic total labeling
  376. Vertex-symmetric graph
  377. Vertex (of a graph)
  378. Vertex clique cover
  379. Vertex clique cover number
  380. Vertex covering number
  381. Vertex cut
  382. Vertex linear arboricity
  383. Vertex minimal dominating graph
  384. Vertex of a hypergraph
  385. Vertex pancyclic graph
  386. Vertex path cover
  387. Vertex path number
  388. Vertex regular graph
  389. Vertex separator
  390. Vertex space
  391. Vertex switch
  392. Vertex t-ranking number
  393. Very strongly perfect graph
  394. Vibration
  395. Vizing's conjecture
  396. Volume of G-trade
  397. Volume of a graph
  398. Voronoi diagram
  399. W-Balanced graph
  400. W-Universal graph
  401. Walk
  402. Walk-matrix
  403. Weak NP-complete problem
  404. Weak NP-hard problem
  405. Weak Perfect Graph Conjecture
  406. Weak clique-covering cycle
  407. Weak clique-covering path
  408. Weak computation
  409. Weak direct product
  410. Weak dominating set
  411. Weak dual graph
  412. Weak order
  413. Weakly-connected dominating number
  414. Weakly-connected dominating set
  415. Weakly arithmetic vertex function
  416. Weakly chordal graph
  417. Weakly connected vertices
  418. Weakly dense m-ary tree
  419. Weakly geodetic graph
  420. Weakly pancyclic graph
  421. Weakly triangulated graph
  422. Weighted degree of a vertex
  423. Weighted domination number
  424. Well-covered graph
  425. Well-located graph
  426. Width
  427. Width of a layout
  428. Width of a tree-decomposition
  429. Wounded spider
  430. Wreath product of graphs
  431. Z-Oblique graph
  432. Z-transformation graph
  433. Zone-interval reprezentation
  434. \alpha-Permutation graph
  435. \gamma-Domination critical graph
  436. \phi-Tolerance competition graph
  437. \phi-Tolerance competition number
  438. Θ-граф
  439. Ёмкостная функция графа
  440. Ёмкость графа
  441. Автомат над деревьями
  442. Алгоритм Беллмана-Мура-Форда
  443. Алгоритм Дейкстры
  444. Алгоритм Касьянова
  445. Алгоритм Кнута-Бендикса
  446. Алгоритм Патерсона-Вегмана
  447. Алгоритм Робертса-Флореса
  448. Алгоритм Тарьяна
  449. Алгоритм Уоршалла
  450. Алгоритм Уэ
  451. Алгоритм Фараджева
  452. Алгоритм Флери
  453. Алгоритм Флойда
  454. Алгоритм Хакими
  455. Алгоритм Хопкрофта-Карпа
  456. Алгоритм Шамира
  457. Алгоритм Штрассена
  458. Альт непосредственно вложенный
  459. База вершин
  460. Базис циклов
  461. Базисный блок
  462. Бездефицитное множество вершин
  463. Безреберный граф
  464. Бесконечная грань плоского графа
  465. Бинарное отношение (на множестве M)
  466. Бинарное отношение эквивалентности
  467. Бицентр дерева
  468. Большое модульное произведение графов
  469. Вектор-каркас
  470. Величина рассечения
  471. Вершина, достижимая из a
  472. Вершина, инцидентная ребру
  473. Вершина гиперграфа
  474. Вершина гиперграфа изолированная
  475. Вершинная группа графа
  476. Вершинная древесность
  477. Вершинная раскраска
  478. Вершинно-порожденный подграф
  479. Вершинно-транзитивный граф
  480. Вершинное число независимости
  481. Вершинный изоморфизм
  482. Вершины взаимосвязные
  483. Вершины сильно связные
  484. Вес подграфа
  485. Ветвящийся орграф
  486. Взаимно простые пути
  487. Взвешенное корневое дерево
  488. Взвешенный массив
  489. Вложенная цепочка уграфа
  490. Внешность цикла
  491. Внутренняя грань
  492. Восходящее изображение
  493. Всесмежное множество вершин
  494. Входящий оркаркас
  495. Высота вершины (в ордереве)
  496. Выходящий оркаркас
  497. Вычислительная модель PRAM
  498. Г- в -1 степени-Конечный граф
  499. Гамильтонова линия
  500. Гамильтоново-связный орграф

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

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