Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Abstract. A Michigan graph G on a vertex set V is called semi-stable if for some υϵV, Γ(Gυ) = Γ(G)υ. It can be shown that all regular graphs are semi-stable and ...
People also ask
It is the purpose of this paper to introduce the concept of semi-stabil- ity for graphs and to show how this can be used to prove that the only.
Abstract We show that a graph G is semi-stable at vertex v if and only if the set of vertices of G adjacent to v is fixed by the automorphism group of Gv, ...
A characterisation of semi-stable graphs is given in terms of ... number of semi-stable graphs on n vertices, and g is the number of ... Two applications of semi- ...
D. A. Holton (1973), 'A report on stable graphs', J. Austral. Math. Soc. 15, 163-171. D. A. Holton (1973a), 'Two applications of semi-stable graphs', Discrete ...
Nov 2, 2016 · Examples of semi-stable models of curves · ag.algebraic-geometry · reference-request · algebraic-curves · deformation-theory · characteristic-p.
Missing: Two applications
In this paper, we introduce a new class of graphs called semi-square stable for which α ( G 2 ) = i ( G ) . We give a necessary and sufficient condition for a ...
May 21, 1974 · D. A. Holton (1973),'Two applications of semi-stable graphs', Discrete Math. 4, 151-158. D. A. Holton (1973a), 'A report on stable graphs', J.
Suppose we are given a curve C, say normal and proper and geometrically connected over K(S) (so C is automatically projective). Does there exist a “good” model ...
Missing: applications | Show results with:applications