Search Results for ""

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

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 ...

Let L be a language of the first-order logic. Assume that the language L has the following sets of nonlogical symbols: 1. C is the set of constant symbols of L. (These are ...

The probability density function for Student's z-distribution is given by f_n(z)=(Gamma(n/2))/(sqrt(pi)Gamma((n-1)/2))(1+z^2)^(-n/2). (1) Now define ...

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^' ...

Let U subset= C be an open set and f a real-valued continuous function on U. Suppose that for each closed disk D^_(P,r) subset= U and every real-valued harmonic function h ...

A map which uses a set of rules to transform elements of a sequence into a new sequence using a set of rules which "translate" from the original sequence to its ...

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...

For a graph vertex x of a graph, let Gamma_x and Delta_x denote the subgraphs of Gamma-x induced by the graph vertices adjacent to and nonadjacent to x, respectively. The ...

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 ...