Все страницы
Материал из WikiGrapp
Предыдущая страница (Chromatic decomposition of a graph) | Следующая страница (Fundamental cutset matrix)
- Diagonal of a block
- Diameter
- Diametral chain
- Diamond
- Difference digraph
- Difference of graphs
- Differential of a graph
- Differential of a set
- Digraph
- Dijkstra's algorithm
- Dimension of a poset
- Dinitz's algorithm
- Direct product
- Direct search
- Directable graph
- Directed acyclic graph
- Directed edge
- Directed forest
- Directed graph
- Directed hypergraph
- Directed hyperpath
- Directed hypertree
- Directed multigraph
- Directed sequence
- Directed tree
- Diregular digraph
- Dirichlet eigenvalue problem
- Disc
- Disconnected graph
- Discrete matroid
- Disjunct union of graphs
- Dismantlable graph
- Dismantling enumeration
- Dismantling order
- Disorientation of an arc
- Dissection
- Distance
- Distance-hereditary graph
- Distance-transitive graph
- Distance between two vertices
- Distributed systems
- Ditree
- Divider
- Domatic number
- Domatic partition
- Domatically full graph
- Dominance number
- Dominant-covering graph
- Dominant-matching graph
- Dominant set
- Dominating cycle
- Dominating function
- Dominating graph
- Dominating path
- Dominating set
- Dominating vertex
- Dominating walk
- Domination graph
- Domination graph (of a tournament)
- Domination number
- Domination number relative to v
- Domination perfect graph
- Domination subdivision number
- Dominator
- Dominator tree
- Domino
- Domsaturation number
- Double competition number
- Double dominating set
- Double domination number
- Double edge dominating set
- Double edge domination number
- Double ray
- Double rotation
- Double star
- Doubly chordal graph
- Doubly perfect ordering
- Doubly regular tournament
- Doubly simplicial vertex
- Doubly stochastic matrix
- Drawing of graph
- Dual graph
- Dual hypergraph
- Dual hypertree
- Dual map
- Dual matroid
- Dual tournament
- Dually chordal graph
- Dually compact closed class of graphs
- Dudeney's round table problem
- Dudeney set
- E-Free grammar
- E-Free сoncatenation closure
- E-Правило
- E-переход
- E k-Cordial graph
- Eccentric graph
- Eccentric sequence
- Eccentricity of a vertex
- Economy region
- Edge
- Edge-cordial graph
- Edge-cordial labeling
- Edge-cover
- Edge-critical graph
- Edge-degree
- Edge-forwarding index
- Edge-graceful graph
- Edge-graceful labeling
- Edge-independent number
- Edge-integrity
- Edge-isoperimetric problem
- Edge-labeling
- Edge-magic total graph
- Edge-magic total labeling
- Edge-ordering
- Edge-pancyclic graph
- Edge-pancyclicity
- Edge-ranking of a graph
- Edge-superconnectivity
- Edge adding
- Edge chromatic number
- Edge clique cover
- Edge clique cover number
- Edge colourable graph
- Edge connectivity
- Edge connectivity number
- Edge core
- Edge covering
- Edge critical graph
- Edge cut, edge cut set
- Edge density
- Edge dominating set
- Edge domination number
- Edge graph
- Edge group of a graph
- Edge incidency matrix
- Edge isomorphic graphs
- Edge k-colourable graph
- Edge k-colouring
- Edge kernel
- Edge list
- Edge monochromatic class
- Edge of a hypergraph
- Edge of attachment
- Edge path cover
- Edge path number
- Edge ranking number
- Edge reconstructibility
- Edge regular graph
- Edge space
- Edge symmetric graph
- Edge t-ranking
- Effectively solvable problem
- Efficient dominating set
- Eigenvalue of a graph
- Element of a graph
- Elementary Petri net
- Elementary homomorphism
- Embedding of a graph
- Emptiness problem
- Empty deadend
- Empty deadlok
- Empty graph
- Empty hypergraph
- Empty loop
- Empty marking problem
- Empty problem
- Empty string
- Empty subgraph
- Empty symbol
- Empty tree
- Enabled transition
- Enclosure transition
- End-edge
- End-vertex
- Endblock
- Endline graph
- Endomorphism
- Endpoint, end-vertex
- Endpoints of a path (chain)
- Energy of graph
- Entire choice number
- Entire chromatic number
- Entire colouring
- Entry
- Entry node of a fragment
- Entry vertex
- Entry vertex of a subgraph
- Environment of a vertex
- Equally coloured vertices
- Equiseparable trees
- Equistable graph
- Equitable partition
- Equivalence of languages problem
- Equivalence problem
- Equivalence relation
- Equivalent cycles
- Equivalent derivations
- Equivalent grammars
- Equivalent program schemata
- Equivalent programs
- Erdos--Gallai criterion
- Essential arc
- Essential independent set
- Euler's formula
- Euler graph
- Eulerian chain
- Eulerian circuit
- Eulerian cycle
- Eulerian digraph
- Eulerian graph
- Eulerian tour
- Eulerian trail
- Evaluated graph
- Evaluation of a graph
- Even component
- Even contractile graph
- Even graph
- Even pair
- Event
- Event-condition system
- Event condition
- Event realization
- Exact double dominating set
- Exact n-step dominating set
- Exact n-step domination graph
- Exceptional graph
- Exclusion operation
- Execution of Petri net
- Execution of large-block schema
- Execution sequence
- Exhaustive search
- Exit
- Exit node of a fragment
- Exponent of a digraph
- Expression DAG
- Expression dag
- Extended odd graph
- Extended regular expression
- Exterior face
- Exterior of a cycle
- External input place
- External output place
- External place
- External stability set
- External vertex
- F-Arc
- F-Direct arc
- F-Dominating cycle
- F-Factor
- F-Heap
- F-Inverse arc
- F-Line
- F-Matching width
- F-Orthogonal subgraph
- F-Path
- F-Rank
- F-Ray
- F-Reachable (from p) node
- F-Region
- F-Stability number
- F-Stable set
- F-Width (of a hypergraph)
- F-Достижимость
- F-Дуга
- F-Линия
- F-Луч
- F-Область
- F-Прямая дуга
- F-Путь
- F-Ранг
- F-Фактор
- FAS-problem
- FVS-problem
- Face
- Facet
- Facial cycle
- Factor-cf-graph
- Factor-control-flow-graph
- Factor-critical graph
- Factor-graph
- Factorization
- Factorization of a graph
- Father of a vertex
- Feedback arc set
- Feedback vertex set
- Fibonacci heap
- Fibre
- Filter
- Final substring
- Finish vertex
- Finishing node of fragment
- Finite-state automation
- Finite automaton
- Finite graph
- Finite tree
- Finiteness problem
- First Order formula
- Five-color theorem
- Fixed vertex
- Flag
- Flat forest
- Flow
- Flow-diagram
- Flow-equivalent graphs
- Flow augmenting path
- Flow control
- Flow dependence
- Flow graph
- Flower
- Forbidden subgraph
- Forcing number
- Forcing set
- Ford-Fulkerson's theorem
- Forest
- Forest-perfect graph
- Forest graph
- Formal language
- Formal language theory
- Forward arc
- Foundtion of G-trade
- Fractional-chromatic number
- Fractional-coloring
- Fractional clique number
- Fractional k-factor
- Fractional matching
- Fractional matching number
- Fragment
- Frame
- Framing number
- Fraternal orientation
- Fraternally orientable digraph
- Fraternally oriented digraph
- Free-choice Petri net
- Free Petri net
- Free language
- Free tree
- Frequency-ordered binary search tree
- Fully disconnected graph
- Functional directed graph
- Functional vertex
- Functionally equivalent program schemata
- Functionally equivalent programs
- Fundamental circuit
