Search Results for ""

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

A graph is strongly perfect if every induced subgraph H has an independent vertex set meeting all maximal cliques of H (Berge and Duchet 1984, Ravindra 1999). Every strongly ...

A second-order ordinary differential equation d/(dx)[p(x)(dy)/(dx)]+[lambdaw(x)-q(x)]y=0, where lambda is a constant and w(x) is a known function called either the density or ...

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

For a particular format in the IEEE 754-2008 framework, a subnormal number is a nonzero floating-point number with magnitude less than the magnitude of that formatÕs smallest ...

An integer n is called a super unitary perfect number if sigma^*(sigma^*(n))=2n, where sigma^*(n) is the unitary divisor function. The first few are 2, 9, 165, 238, 1640, ... ...

Let K be a T2-topological space and let F be the space of all bounded complex-valued continuous functions defined on K. The supremum norm is the norm defined on F by ...

In general, an unresolved nth root, commonly involving a radical symbol RadicalBox[x, n], is known as a surd. However, the term surd or "surd expression" (e.g., Hardy 1967, ...

The order n of an algebraic surface is the order of the polynomial defining a surface, which can be geometrically interpreted as the maximum number of points in which a line ...

A graph that can be reduced to another graph with the same degree sequence by edge-switching is known as a switchable graph. Conversely, a graph that cannot be reduced to ...