Search Results for ""
11 - 20 of 113 for nodeSearch Results
View search results from all Wolfram sites (1302 matches)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 ...
A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...
The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.
...