Search Results for ""
761 - 770 of 2376 for onnected Dominating SetSearch Results
An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...
The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...
Given a module M over a unit ring R, the set End_R(M) of its module endomorphisms is a ring with respect to the addition of maps, (f+g)(x)=f(x)+g(x), for all x in M, and the ...
A set of curves whose equations are of the same form but which have different values assigned to one or more parameters in the equations. Families of curves arise, for ...
Let D be a planar Abelian difference set and t be any divisor of n. Then t is a numerical multiplier of D, where a multiplier is defined as an automorphism alpha of a group G ...
A fractional clique of a graph G is a nonnegative real function on the vertices of G such that sum of the values on the vertices of any independent set is at most one. The ...
A distribution of values of a discrete variate represented graphically by plotting points (x_1,f_1), (x_2,f_2), ..., (x_k,f_k), and drawing a set of straight line segments ...
The condition for isoenergetic nondegeneracy for a Hamiltonian H=H_0(I)+epsilonH_1(I,theta) is |(partial^2H_0)/(partialI_ipartialI_j) (partialH_0)/(partialI_i); ...
Let X be a topological vector space and for an arbitrary point x in X, denote by N_(x) the collection of all neighborhoods of x in X. A local base at x is any set B subset ...
Let f(x) be a finite and measurable function in (-infty,infty), and let epsilon be freely chosen. Then there is a function g(x) such that 1. g(x) is continuous in ...
...
View search results from all Wolfram sites (33238 matches)

