Все страницы
Перейти к навигации
Перейти к поиску
- Strong closure of a graph
- Strong component of a digraph
- Strong degree of a graph
- Strong dominating set
- Strong domination number
- Strong input
- Strong matching
- Strong orientation
- Strong output
- Strong perfect graph conjecture
- Strong product of graphs
- Strong result
- Strong support vertex
- Strong unique independence graph
- Strongly NP-complete problem
- Strongly NP-hard problem
- Strongly chordal graph
- Strongly circuit closed graph
- Strongly circuit connected edges
- Strongly circuit connected vertices
- Strongly coadjoint vertices
- Strongly connected component
- Strongly connected graph
- Strongly connected region
- Strongly connected vertices
- Strongly cyclic edge connected graph
- Strongly cyclically closed graph
- Strongly dense m-ary tree
- Strongly dense tree
- Strongly equistable graph
- Strongly geodetic graph
- Strongly non-circular grammar
- Strongly perfect graph
- Strongly quasibiconnected graph
- Strongly transitive graph
- Strongly unilateral digraph
- Strongly weak digraph
- Structured net formula
- Subchain
- Subchromatic number
- Subdegrees of a graph group
- Subdivided edge
- Subdivision graph
- Subdivision of an edge
- Subgraph
- Subgraph derivable graph
- Subgraph derivation
- Subgraph isomorphism problem
- Subhypergraph
- Submodular function (of a matroid)
- Submodular inequality
- Subnet
- Suborthogonal double cover
- Suborthogonal subgraph
- Substitution of a graph
- Substitutional closure
- Substring
- Subtree
- Subtree with the root r
- Subword
- Succession relation
- Successive coloring
- Successor of a vertex
- Suffix
- Sum graph
- Sum hypergraph
- Sum labeling
- Sum number
- Sum of graphs
- Sunlike graph
- Super (a,d)-edge-antimagic total graph
- Super (a,d)-edge-antimagic total labeling
- Super edge-connected graph
- Super point-connected graph
- Superconnected graph
- Supercritical graph
- Supereulerian graph
- Supereulerian index
- Supergraph
- Supermagic graph
- Superoblique graph
- Superperfect graph
- Superposition of graphs
- Support vertex
- Surviving route digraph
- Switch equivalent graphs
- Switch operation
- Switching
- Symbol
- Symmetric binary tree
- Symmetric directed graph
- Symmetric edge
- Symmetric relation
- Symmetric traversal
- Symmetrical difference of graphs
- Symmetrical graph
- Symmetrical group of a graph
- Synchrograph
- Synchronization graph
- Syntactical diagram
- Syntax analysis
- Syntax diagram
- Syntax tree
- System of disjoint representatives
- System of distinct representatives
- Systems with adjacency lists
- Systems with edge list
- T-Code (in a graph)
- T-Color-critical
- T-Join
- T-Numbering
- T-Perfect code
- T-Spanner
- T-Tough graph
- T-Нумерация
- TREEWIDTH problem
- Tail of a hyperarc
- Tail place
- Target
- Tensor product
- Term
- Term-rewriting system
- Terminal alphabet
- Terminal edge
- Terminal language
- Terminal marking
- Terminal node
- Terminal node of a fragment
- Terminal state
- Terminal symbol
- Terminal vertex
- Termination of a compound transition
- Test and decrement operator
- Theta-graph
- Thickness of a graph
- Threshold graph
- Tightened graph
- Tightly connected vertices
- Time complexity
- Timed Petri nets
- Token
- Tolerance graph
- Tolerance representation
- Topological graph
- Topological measures of program complexity
- Topological representation of a graph
- Topological sorting
- Toroidal graph
- Toroidal thickness
- Total Z-transformation graph
- Total chromatic number
- Total coloring
- Total connectivity
- Total dominating function
- Total dominating number
- Total dominating set
- Total domination edge critical graph
- Total domination number
- Total domination subdivision number
- Total edge length of a graph
- Total graph
- Total k-subdominating function
- Total k-subdomination number
- Total labeling
- Total restrained dominating set
- Total status
- Totally adjacent vertex set
- Totally balanced hypergraph
- Totally balanced matrix
- Totally irregular graph
- Totally stratified net formula
- Toughness of a graph
- Tournament
- Tournament matrix
- Traceable digraph
- Traceable graph
- Trail
- Trampoline of order p
- Transducer
- Transformation graph
- Transformer
- Transition
- Transition firing
- Transitivable graph
- Transitive closure of a directed graph
- Transitive closure of a relation
- Transitive directed graph
- Transitive group of a graph
- Transitive orientation
- Transitive reduction of a digraph
- Transitive relation
- Transitive series-parallel digraph
- Transitive tournament
- Transitively orientable graph
- Transportation network
- Transposition symmetry permutation
- Transversal (of a family S)
- Transversal number
- Transversal set
- Transversal set of a hypergraph
- Trap
- Trapezoid graph
- Traveling salesman problem
- Traveling tourist problem
- Traversal of a graph
- Tree
- Tree-decomposition
- Tree-perfect graph
- Tree arc
- Tree automaton
- Tree dominating set
- Tree domination number
- Tree grammar
- Tree graph
- Tree language
- Tree model
- Tree packing
- Tree polynom of a graph
- Tree symmetry number
- Tree t-spanner
- Tree traversal inorder
- Treewidth of a graph
- Triad
- Triangle
- Triangle-free graph
- Triangular graph
- Triangular vertex
- Triangulated-perfect graph
- Triangulated graph
- Triangulated triangle
- Triangulation of a circuit
- Triangulation of a graph
- Triconnected graph
- Trie
- Trivial deadend
- Trivial deadlok
- Trivial graph
- Trivial interval
- Trivial tree
- True dependence
- True twins
- Turan number
- Turing machine
- Tutte polynomial
- Two-terminal DAG
- Two-way infinite path
- Two-way infinite sequence
- Two-way pushdown automaton
- Two edge merging
- Type-0 grammar
- Type-1 grammar
- Type-2 grammar
- Type-3 grammar
- UPC-graphs
- Ultracenter
- Ultraradius
- Unary node
- Unary vertex
- Unbalanced tree
- Unbounded Petri net
- Unbounded face
- Unbounded place
- Unconnected directed graph
- Undecidable problem
- Undensity
- Underlying graph
- Underlying hyperedge tree
- Underlying vertex tree
- Undirected graph
- Undirected hyperpath
- Unfold process net
- Unicursal graph
- Unicyclic graph
- Unification problem
- Uniform central graph
- Uniform hypergraph
- Uniform inflation
- Uniform star-factor
- Unigraph
- Unigraphical (degree) sequence
- Unilateral connectivity
- Unilaterally connected component
- Unilaterally connected digraph
- Union of graphs
- Unique eccentric point graph
- Uniquely coloured graph
- Uniquely pancyclic graph
- Uniquely transitively orientable graph
- Unit interval graph
- Unitary graph
- Universal graph
- Unordered labeled tree
- Unrestricted grammar
- Unsaturated vertex
- Upper-level transition
- Upper n-domination number
- Valency of a vertex
- Value of a cut
- Value of a flow
- Value of a schema under interpretation
- Variable vertex
- Variance of a graph
- Vector matroid
- Vertex
- Vertex-antimagic total labeling
- Vertex-arboricity
- Vertex-clique incidence bigraph
- Vertex-connectivity number
- Vertex-cover polynomial
- Vertex-edge incidence matching
- Vertex-edge incidence matrix
- Vertex-forwarding index
- Vertex-labeling
- Vertex-magic graph
- Vertex-magic labeling
- Vertex-magic total labeling
- Vertex-symmetric graph
- Vertex (of a graph)
- Vertex clique cover
- Vertex clique cover number
- Vertex coloring
- Vertex connectivity
- Vertex cover, vertex covering
- Vertex covering number
- Vertex covering problem
- Vertex critical graph
- Vertex cut
- Vertex disjoint graphs
- Vertex incidence matrix
- Vertex incident to an edge
- Vertex involving
- Vertex kernel
- Vertex level
- Vertex linear arboricity
- Vertex minimal dominating graph
- Vertex of a hypergraph
- Vertex of attachment
- Vertex pancyclic graph
- Vertex path cover
- Vertex path number
- Vertex regular graph
- Vertex separator
- Vertex space
- Vertex splitting
- Vertex star