TOPICS
Search

Search Results for ""


361 - 370 of 880 for Weakly Connected DigraphSearch Results
Two closed simply connected 4-manifolds are homeomorphic iff they have the same bilinear form beta and the same Kirby-Siebenmann invariant kappa. Any beta can be realized by ...
The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...
The Diophantine equation x^2+y^2=p can be solved for p a prime iff p=1 (mod 4) or p=2. The representation is unique except for changes of sign or rearrangements of x and y. ...
An authalic latitude given by phi_g=tan^(-1)[(1-e^2)tanphi]. (1) The series expansion is phi_g=phi-e_2sin(2phi)+1/2e_2^2sin(4phi)+1/3e_2^3sin(6phi)+..., (2) where ...
The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...
The periphery of a graph G is the subgraph of G induced by vertices that have graph eccentricities equal to the graph diameter. The periphery of a connected graph may be ...
The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).
Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...
Let u_1<=u_2<=... be harmonic functions on a connected open set U subset= C. Then either u_j->infty uniformly on compact sets or there is a finite-values harmonic function u ...
A Heegaard splitting of a connected orientable 3-manifold M is any way of expressing M as the union of two (3,1)-handlebodies along their boundaries. The boundary of such a ...
1 ... 34|35|36|37|38|39|40 ... 88 Previous Next

...