Search Results for ""
651 - 660 of 2190 for Semi Logarithmic GraphSearch Results
The Prelle-Singer method is a semi-decision procedure for solving nonlinear first-order ordinary differential equations of the form y^'=P(x,y)/Q(x,y), where P and Q are ...
A topological space X is semilocally simply connected (also called semilocally 1-connected) if every point x in X has a neighborhood U such that any loop L:[0,1]->U with ...
The Sombor energy of a graph is defined as the graph energy of its Sombor matrix, i.e., the sum of the absolute values of the eigenvalues of its Sombor matrix.
The parallel curves for (outward) offset k of an ellipse with semi-axis lengths a and b are given by x_p = (a+(bk)/(sqrt(a^2sin^2t+b^2cos^2t)))cost (1) y_p = ...
The mathematical study of the properties of the formal mathematical structures called graphs.
The natural logarithm lnx is the logarithm having base e, where e=2.718281828.... (1) This function can be defined lnx=int_1^x(dt)/t (2) for x>0. This definition means that e ...
The multiplicity of a multigraph is its maximum edge multiplicity.
Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...
For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...
The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...
...
View search results from all Wolfram sites (15254 matches)

