Search Results for ""

The system of partial differential equations del ^4u = E(v_(xy)^2-v_(xx)v_(yy)) (1) del ^4v = alpha+beta(u_(yy)v_(xx)+u_(xx)v_(yy)-2u_(xy)v_(xy)), (2) where del ^4 is the ...

The x-axis is the horizontal axis of a two-dimensional plot in Cartesian coordinates that is conventionally oriented to point to the right (left figure). In three dimensions, ...

The vertical axis of a two-dimensional plot in Cartesian coordinates. Physicists and astronomers sometimes call this axis the ordinate, although that term is more commonly ...

A binary unit of information equal to 8 bits. Unfortunately, the storage of binary numbers in computers is not entirely standardized. Because computers store information in ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

The Sierpiński gasket graph of order n is the graph obtained from the connectivity of the Sierpiński sieve. The first few Sierpiński gasket graphs are illustrated above. S_2 ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...