Search Results for ""
21 - 30 of 200 for Saddle node bifurcationSearch Results
A tree spread in which each node has a finite number of children.
A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.
A graph vertex in a graph is said to be an even node if its vertex degree is even.
A fork of a tree T is a node of T which is the endpoint of two or more branches.
A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...
A graph vertex in a graph is said to be an odd node if its vertex degree is odd.
A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).
Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...
A local source is a node of a directed graph with no entering edges (Borowski and Borwein 1991, p. 401; left figure), and a global source (often simply called a source) is a ...
The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the ...
...