Let D be an oriented graph of order n β₯ 9, minimum degree at least n -2, such that, for the choice of distinct vertices x and y, . Graph Theory 18 (1994), 461-468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is, in fact, vertex pancyclic. This also
A note on vertex orders for stability number
β Scribed by Mahadev, N. V. R.; Reed, B. A.
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 115 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
We investigate vertex orders that can be used to obtain maximum stable sets by a simple greedy algorithm in polynomial time in some classes of graphs. We characterize a class of graphs for which the stability number can be obtained by a simple greedy algorithm. This class properly contains previously known classes of graphs for which the stability number can be computed in polynomial time.
π SIMILAR VOLUMES
can also be a serious problem resulting in digital gangrene. Raynaud's phenomenon may occur independently or in conjunction with another disease, such as systemic lupus erythematosus (SLE), CREST syndrome (calcinosis, Raynaud's phenomenon, esophageal dysmotility, interstitial dysmotility, sclerodact
The problem of robust stabilization of nonlinear systems with feedback linearizable nominal part and norm-bounded nonlinear uncertainties is investigated. Necessary and sufficient conditions are obtained for robust stabilization of such systems. A design procedure is developed which combines feedbac
An artificial-viscosity finite-difference scheme is introduced for stabilizing the solutions of advectiondiffusion equations. Although only the linear one-dimensional case is discussed, the method is easily susceptible to generalization. Some theory and comparisons with other well-known schemes are