Search Results for ""
161 - 170 of 293 for loaded diceSearch Results
![](/common/images/search/spacer.gif)
The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...
A cone with elliptical cross section. The parametric equations for an elliptic cone of height h, semimajor axis a, and semiminor axis b are x = a(h-u)/hcosv (1) y = ...
A quadrilateral in which a pair of opposite sides have the same length and are inclined at 60 degrees to each other (or equivalently, satisfy <A>+<B>=120 degrees). Some ...
The numbers 2^npq and 2^nr are an amicable pair if the three integers p = 2^m(2^(n-m)+1)-1 (1) q = 2^n(2^(n-m)+1)-1 (2) r = 2^(n+m)(2^(n-m)+1)^2-1 (3) are all prime numbers ...
The even part Ev(n) of a positive integer n is defined by Ev(n)=2^(b(n)), where b(n) is the exponent of the exact power of 2 dividing n. The values for n=1, 2, ..., are 1, 2, ...
The study of how the intrinsic structure of graphs ensures certain types of properties (e.g., clique-formation and graph colorings) under appropriate conditions.
Let f(z) = z+a_1+a_2z^(-1)+a_3z^(-2)+... (1) = zsum_(n=0)^(infty)a_nz^(-n) (2) = zg(1/z) (3) be a Laurent polynomial with a_0=1. Then the Faber polynomial P_m(f) in f(z) of ...
The first Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_1=sum_(i=1)^nd_i^2. The notations Z_1 (e.g., Lin et al. 2023) ...
Let X(x)=X(x_1,x_2,...,x_n) be a random vector in R^n and let f_X(x) be a probability distribution on X with continuous first and second order partial derivatives. The Fisher ...
A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...
![](/common/images/search/spacer.gif)
...