Search Results for ""

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...

The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...

Consider the plane figure obtained by drawing each diagonal in a regular polygon. If each point of intersection is associated with a node and diagonals are split ar each ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

The Kronecker sum is the matrix sum defined by A direct sum B=A tensor I_b+I_a tensor B, (1) where A and B are square matrices of order a and b, respectively, I_n is the ...

A related rates problem is the determination of the rate at which a function defined in terms of other functions changes. Related rates problems can be solved by computing ...

There are a number of hypotraceable and hypohamiltonian graphs associated with Carsten Thomassen. These graphs, illustrated above, are implemented in the Wolfram Language as ...

The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...