The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we give a detailed survey of stability properties of various combinations of graphs. We review previous work on unions, joins and (cartesian) products of graphs, and supply further evidence of the unpredictability of the stability index function under cartesian products in that we show that for r>2, the r-cube has stability index 1, which for most values of m and n the product...
This paper discusses the future of Software Engineering education in Australia in the 1990s from the perspective of the current debate on the separation of Computer Science and Software Engineering as academic disciplines. It supports the prevailing view that maintaining the unity of Computer Science and Software Engineering is of critical importance.
If G is a graph with vertex set V(G) and (vertex) automorphism group γ(G), then a sequence s={vπ(i)}i=1k of distinct vertices of G is a partial stabilising sequence for G if $$\Gamma \left( {G_{S_n } } \right) = \Gamma \left( G \right)_{S_n } $$ for n = 1,...,k. Here S is the set $$\bigcup\limits_{i = 1}^n {V_{\pi (i)} ,G_{S_n } } $$ is the subgraph of G induced by the subset V(G) — Sn...